The following pages link to Sandra Zilles (Q249060):
Displaying 50 items.
- Predicting the size of IDA\(^*\)'s search tree (Q360040) (← links)
- Learning heuristic functions for large state spaces (Q420796) (← links)
- Algebraic methods proving Sauer's bound for teaching complexity (Q465250) (← links)
- The computational complexity of avoiding spurious states in state space abstraction (Q622104) (← links)
- An approach to intrinsic complexity of uniform learning (Q860823) (← links)
- Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces (Q901034) (← links)
- Learning recursive functions: A survey (Q924164) (← links)
- Learning indexed families of recursive languages from positive data: A survey (Q924177) (← links)
- Models of active learning in group-structured state spaces (Q963065) (← links)
- Incremental learning with temporary memory (Q982647) (← links)
- Separation of uniform learning classes. (Q1426150) (← links)
- On the teaching complexity of linear sets (Q1704564) (← links)
- Increasing the power of uniform inductive learners (Q1780449) (← links)
- The fast search number of a complete \(k\)-partite graph (Q1799234) (← links)
- Learning without coding (Q1939265) (← links)
- A simple method for proving lower bounds in the zero-visibility cops and robber game (Q2156313) (← links)
- Predicting optimal solution cost with conditional probabilities (Q2254628) (← links)
- The complexity of exact learning of acyclic conditional preference networks from swap examples (Q2289025) (← links)
- Finitely distinguishable erasing pattern languages (Q2290682) (← links)
- A partition approach to lower bounds for zero-visibility cops and robber (Q2301762) (← links)
- Formal language identification: query learning vs. gold-style learning (Q2390327) (← links)
- Distinguishing pattern languages with membership examples (Q2407113) (← links)
- Some natural conditions on incremental learning (Q2461797) (← links)
- A general comparison of language learning from examples and from queries (Q2465036) (← links)
- Relations between Gold-style learning and query learning (Q2581538) (← links)
- Aggregating preferences represented by conditional preference networks (Q2695422) (← links)
- Fast searching on cactus graphs (Q2696935) (← links)
- Classifying the Arithmetical Complexity of Teaching Models (Q2830273) (← links)
- Combining Models of Approximation with Partial Learning (Q2835617) (← links)
- On the Teaching Complexity of Linear Sets (Q2835620) (← links)
- Partial Learning of Recursively Enumerable Languages (Q2859210) (← links)
- Order Compression Schemes (Q2859215) (← links)
- Polynomial-Time Algorithms for Learning Typed Pattern Languages (Q2890199) (← links)
- (Q2934114) (← links)
- Generalizing Labeled and Unlabeled Sample Compression to Multi-label Concept Classes (Q2938738) (← links)
- Fast Searching on Complete k-partite Graphs (Q2958311) (← links)
- A Survey on Recent Results on Partial Learning (Q2989964) (← links)
- (Q3046707) (← links)
- Learning Relational Patterns (Q3093941) (← links)
- Erratum: Learning without Coding (Q3093971) (← links)
- Learning Complex Concepts Using Crowdsourcing: A Bayesian Approach (Q3095309) (← links)
- (Q3148804) (← links)
- Sauer’s Bound for a Notion of Teaching Complexity (Q3164813) (← links)
- Towards a Better Understanding of Incremental Learning (Q3522984) (← links)
- Active Learning of Group-Structured Environments (Q3529932) (← links)
- Learning with Temporary Memory (Q3529940) (← links)
- (Q4473558) (← links)
- (Q4645637) (← links)
- (Q4645644) (← links)
- Learning Theory (Q4680874) (← links)
