Pages that link to "Item:Q1916529"

The following pages link to Asking questions to minimize errors (Q1916529):

Displaying 17 items.

• Constraint acquisition (Q511791) (← links)
• On the limits of proper learnability of subclasses of DNF formulas (Q676245) (← links)
• Theory revision with queries: Horn, read-once, and parity formulas (Q814598) (← links)
• Efficient multiple constraint acquisition (Q823769) (← links)
• Learning recursive functions: A survey (Q924164) (← links)
• A greedy randomized adaptive search procedure (GRASP) for inferring logical clauses from examples in polynomial time and some extensions (Q969776) (← links)
• Learning conditional preference networks (Q991013) (← links)
• An algorithm to learn read-once threshold formulas, and transformations between learning models (Q1327594) (← links)
• The query complexity of learning DFA (Q1336037) (← links)
• Simple learning algorithms using divide and conquer (Q1355381) (← links)
• Non-adaptive learning of a hidden hypergraph (Q1704557) (← links)
• The learnability of unions of two rectangles in the two-dimensional discretized space (Q1807675) (← links)
• Even linear simple matrix languages: formal language properties and grammatical inference. (Q1853536) (← links)
• The query complexity of finding local minima in the lattice (Q1854471) (← links)
• Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
• Non-adaptive Learning of a Hidden Hypergraph (Q2835619) (← links)
• Exact learning of DNF formulas using DNF hypotheses (Q5916223) (← links)