Sandra Zilles

Artif. Intell., 2020

Motion Path Planning of Two Robot Arms in a Common Workspace.

[BibT_eX]

[DOI]

M. Amir Salmaninejad

Mohammad Hossein Nikravan

René V. Mayorga

Proceedings of the 2020 IEEE International Conference on Systems, Man, and Cybernetics, 2020

Combining Direct Trust and Indirect Trust in Multi-Agent Systems.

[BibT_eX]

[DOI]

Elham Parhizkar

Mohammad Hossein Nikravan

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

2019

A Partition Approach to Lower Bounds for Zero-Visibility Cops and Robber.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

Indirect Trust is Simple to Establish.

[BibT_eX]

[DOI]

Elham Parhizkar

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Optimal Collusion-Free Teaching.

[BibT_eX]

[DOI]

David G. Kirkpatrick

Proceedings of the Algorithmic Learning Theory, 2019

New Results on the Zero-Visibility Cops and Robber Game.

[BibT_eX]

[DOI]

Yuan Xue

Boting Yang

Proceedings of the Algorithmic Aspects in Information and Management, 2019

On the Optimal Efficiency of Cost-Algebraic A.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

On the teaching complexity of linear sets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

An Overview of Machine Teaching.

[BibT_eX]

[DOI]

CoRR, 2018

Interactive Learning of Acyclic Conditional Preference Networks.

[BibT_eX]

[DOI]

Eisa Alanazi

Malek Mouhoub

CoRR, 2018

The Fast Search Number of a Complete k-Partite Graph.

[BibT_eX]

[DOI]

Algorithmica, 2018

2017

Preference-based Teaching.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2017

Distinguishing pattern languages with membership examples.

[BibT_eX]

[DOI]

Inf. Comput., 2017

An Empirical Study of the Effects of Spurious Transitions on Abstraction-based Heuristics.

[BibT_eX]

[DOI]

CoRR, 2017

Front-to-End Bidirectional Heuristic Search with Near-Optimal Node Expansions.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Preference-based Teaching of Unions of Geometric Objects.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Algorithmic Learning Theory, 2017

Erasing Pattern Languages Distinguishable by a Finite Number of Strings.

[BibT_eX]

[DOI]

Fahimeh Bayeh

Proceedings of the International Conference on Algorithmic Learning Theory, 2017

Sufficient Conditions for Node Expansion in Bidirectional Heuristic Search.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling, 2017

2016

Inductive Inference.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Partial learning of recursively enumerable languages.

[BibT_eX]

[DOI]

Frank Stephan

Theor. Comput. Sci., 2016

Order compression schemes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Prediction of retail prices of products using local competitors.

[BibT_eX]

[DOI]

Int. J. Bus. Intell. Data Min., 2016

Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces.

[BibT_eX]

[DOI]

Roni Stern

Ariel Felner

Artif. Intell., 2016

Interactive Learning from Multiple Noisy Labels.

[BibT_eX]

[DOI]

Shankar Vembu

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2016

Heuristic Subset Selection in Classical Planning.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

The Complexity of Learning Acyclic CP-Nets.

[BibT_eX]

[DOI]

Eisa Alanazi

Malek Mouhoub

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Fast Searching on Complete k-partite Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2016

Classifying the Arithmetical Complexity of Teaching Models.

[BibT_eX]

[DOI]

Achilles Beros

Mohammad Hossein Nikravan

Proceedings of the Algorithmic Learning Theory - 27th International Conference, 2016

2015

Detecting Transmembrane Proteins Using Decision Trees.

[BibT_eX]

[DOI]

Ashwani Kumar

Proceedings of the Discovery Science - 18th International Conference, 2015

Open Problem: Recursive Teaching Dimension Versus VC Dimension.

[BibT_eX]

[DOI]

Proceedings of The 28th Conference on Learning Theory, 2015

Combining Models of Approximation with Partial Learning.

[BibT_eX]

[DOI]

Frank Stephan

Proceedings of the Algorithmic Learning Theory - 26th International Conference, 2015

2014

Algebraic methods proving Sauer's bound for teaching complexity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Recursive teaching dimension, VC-dimension and sample compression.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2014

A Polynomial-Time Algorithm for Computing the Resilience of Arrangements of Ray Sensors.

[BibT_eX]

[DOI]

David G. Kirkpatrick

Boting Yang

Int. J. Comput. Geom. Appl., 2014

Predicting optimal solution cost with conditional probabilities - Predicting optimal solution cost.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2014

Distinguishing Pattern Languages with Membership Examples.

[BibT_eX]

[DOI]

Zeinab Mazadi

Proceedings of the Language and Automata Theory and Applications, 2014

Sample Compression for Multi-label Concept Classes.

[BibT_eX]

[DOI]

Proceedings of The 27th Conference on Learning Theory, 2014

Generalizing Labeled and Unlabeled Sample Compression to Multi-label Concept Classes.

[BibT_eX]

[DOI]

Rahim Samei

Boting Yang

Proceedings of the Algorithmic Learning Theory - 25th International Conference, 2014

Editors' Introduction.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory - 25th International Conference, 2014

A Comparison of h 2 and MMM for Mutex Pair Detection Applied to Pattern Databases.

[BibT_eX]

[DOI]

Proceedings of the Advances in Artificial Intelligence, 2014

Robust Features for Detecting Evasive Spammers in Twitter.

[BibT_eX]

[DOI]

Muhammad Rezaul Karim

Proceedings of the Advances in Artificial Intelligence, 2014

2013

Learning without coding.

[BibT_eX]

[DOI]

Samuel E. Moelius III

Theor. Comput. Sci., 2013

Predicting the size of IDA*'s search tree.

[BibT_eX]

[DOI]

Artif. Intell., 2013

Using Coarse State Space Abstractions to Detect Mutex Pairs.

[BibT_eX]

[DOI]

Proceedings of the Tenth Symposium on Abstraction, Reformulation, and Approximation, 2013

Learning Models of Activities Involving Interacting Objects.

[BibT_eX]

[DOI]

Cristina E. Manfredotti

Kim Steenstrup Pedersen

Howard J. Hamilton

Proceedings of the Advances in Intelligent Data Analysis XII, 2013

Detecting Mutex Pairs in State Spaces by Sampling.

[BibT_eX]

[DOI]

Proceedings of the AI 2013: Advances in Artificial Intelligence, 2013

Stratified tree search: a novel suboptimal heuristic search algorithm.

[BibT_eX]

[DOI]

Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

2012

Predicting Optimal Solution Cost with Bidirectional Stratified Sampling (Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

Learning Heuristic Functions Faster by Using Predicted Solution Costs.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

Polynomial-Time Algorithms for Learning Typed Pattern Languages.

[BibT_eX]

[DOI]

Michael Geilke

Proceedings of the Language and Automata Theory and Applications, 2012

Improved Query Suggestion by Query Search.

[BibT_eX]

[DOI]

Xiaomin Zhang

Proceedings of the KI 2012: Advances in Artificial Intelligence, 2012

PAC-Learning with General Class Noise Models.

[BibT_eX]

[DOI]

Shahin Jabbari

Proceedings of the KI 2012: Advances in Artificial Intelligence, 2012

Sauer's Bound for a Notion of Teaching Complexity.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory - 23rd International Conference, 2012

Predicting Optimal Solution Cost with Bidirectional Stratified Sampling.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling, 2012

Fast and Accurate Predictions of IDA*'s Performance.

[BibT_eX]

[DOI]

Levi Lelis

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011

Preface.

[BibT_eX]

[DOI]

Gábor Lugosi

Theor. Comput. Sci., 2011

Models of Cooperative Teaching and Learning.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2011

Learning heuristic functions for large state spaces.

[BibT_eX]

[DOI]

Artif. Intell., 2011

Competitive Search in Symmetric Trees.

[BibT_eX]

[DOI]

David G. Kirkpatrick

Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Improved Prediction of IDA*'s Performance via Epsilon-Truncation.

[BibT_eX]

[DOI]

Levi Lelis

Proceedings of the Fourth Annual Symposium on Combinatorial Search, 2011

Simultaneous Tracking and Activity Recognition.

[BibT_eX]

[DOI]

Cristina E. Manfredotti

David J. Fleet

Howard J. Hamilton

Proceedings of the IEEE 23rd International Conference on Tools with Artificial Intelligence, 2011

Erratum: Learning without Coding.

[BibT_eX]

[DOI]

Samuel E. Moelius

Proceedings of the Algorithmic Learning Theory - 22nd International Conference, 2011

Learning Relational Patterns.

[BibT_eX]

[DOI]

Michael Geilke

Proceedings of the Algorithmic Learning Theory - 22nd International Conference, 2011

Learning Complex Concepts Using Crowdsourcing: A Bayesian Approach.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Decision Theory - Second International Conference, 2011

A Bayesian Concept Learning Approach to Crowdsourcing.

[BibT_eX]

[DOI]

Proceedings of the Interactive Decision Theory and Game Theory, 2011

Time Complexity of Iterative-Deepening A*: The Informativeness Pathology (Abstract).

[BibT_eX]

[DOI]

Levi Lelis

Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010

Incremental learning with temporary memory.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Models of active learning in group-structured state spaces.

[BibT_eX]

[DOI]

Gábor Bartók

Csaba Szepesvári

Inf. Comput., 2010

The computational complexity of avoiding spurious states in state space abstraction.

[BibT_eX]

[DOI]

Artif. Intell., 2010

Bootstrap Learning of Heuristic Functions.

[BibT_eX]

[DOI]

Proceedings of the Third Annual Symposium on Combinatorial Search, 2010

Learning without Coding.

[BibT_eX]

[DOI]

Samuel E. Moelius

Proceedings of the Algorithmic Learning Theory, 21st International Conference, 2010

Recursive Teaching Dimension, Learning Complexity, and Maximum Classes.

[BibT_eX]

[DOI]

Thorsten Doliwa

Proceedings of the Algorithmic Learning Theory, 21st International Conference, 2010

2009

Query Suggestion by Query Search: A New Approach to User Support in Web Search.

[BibT_eX]

[DOI]

Shen Jiang

Proceedings of the 2009 IEEE/WIC/ACM International Conference on Web Intelligence, 2009

Downward Path Preserving State Space Abstractions (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Eighth Symposium on Abstraction, Reformulation, and Approximation, 2009

Unsupervised Class Separation of Multivariate Data through Cumulative Variance-Based Ranking.

[BibT_eX]

[DOI]

Andrew Foss

Osmar R. Zaïane

Proceedings of the ICDM 2009, 2009

2008

Inductive Inference.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Learning recursive functions: A survey.

[BibT_eX]

[DOI]

Thomas Zeugmann

Theor. Comput. Sci., 2008

Learning indexed families of recursive languages from positive data: A survey.

[BibT_eX]

[DOI]

Thomas Zeugmann

Theor. Comput. Sci., 2008

Foreword.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Empirical Analysis of the Rank Distribution of Relevant Documents in Web Search.

[BibT_eX]

[DOI]

Shen Jiang

Robert Holte

Proceedings of the 2008 IEEE / WIC / ACM International Conference on Web Intelligence, 2008

Teaching Dimensions based on Cooperative Learning.

[BibT_eX]

[DOI]

Proceedings of the 21st Annual Conference on Learning Theory, 2008

Learning with Temporary Memory.

[BibT_eX]

[DOI]

Samuel E. Moelius

Proceedings of the Algorithmic Learning Theory, 19th International Conference, 2008

Active Learning of Group-Structured Environments.

[BibT_eX]

[DOI]

Gábor Bartók

Csaba Szepesvári

Proceedings of the Algorithmic Learning Theory, 19th International Conference, 2008

What Is the Role of the Semantic Layer Cake for Guiding the Use of Knowledge Representation and Machine Learning in the Development of the Semantic Web?

[BibT_eX]

[DOI]

Randy Goebel

Christoph Ringlstetter

Andreas Dengel

Gunnar Aastrand Grimnes

Proceedings of the Symbiotic Relationships between Semantic Web and Knowledge Engineering, 2008

2007

A general comparison of language learning from examples and from queries.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Some natural conditions on incremental learning.

[BibT_eX]

[DOI]

Inf. Comput., 2007

2006

An approach to intrinsic complexity of uniform learning.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Towards a Better Understanding of Incremental Learning.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 17th International Conference, 2006

2005

Increasing the power of uniform inductive learners.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2005

Relations between Gold-style learning and query learning.

[BibT_eX]

[DOI]

Inf. Comput., 2005

Security Issues for Pervasive Personalized Communication Systems.

[BibT_eX]

[DOI]

Bertin Klein

Tristan Miller

Proceedings of the Security in Pervasive Computing, Second International Conference, 2005

Algorithmic Learning: Formal Models and Prototypical Applications.

[BibT_eX]

[DOI]

Proceedings of the Marktplatz Internet: von E-Learning bis E-Payment, 2005

Gold-Style and Query Learning Under Various Constraints on the Target Class.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 16th International Conference, 2005

2004

Separation of uniform learning classes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Formal language identification: query learning vs. Gold-style learning.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2004

Replacing Limit Learners with Equally Powerful One-Shot Query Learners.

[BibT_eX]

[DOI]

Proceedings of the Learning Theory, 17th Annual Conference on Learning Theory, 2004

Comparison of Query Learning and Gold-Style Learning in Dependence of the Hypothesis Space.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 15th International Conference, 2004

2003

Uniform learning of recursive functions.

[BibT_eX]

[DOI]

PhD thesis, 2003

Intrinsic Complexity of Uniform Learning.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 14th International Conference, 2003

On the Learnability of Erasing Pattern Languages in the Query Model.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 14th International Conference, 2003

2002

Merging Uniform Inductive Learners.

[BibT_eX]

[DOI]

Proceedings of the Computational Learning Theory, 2002

2001

On the Synthesis of Strategies Identifying Recursive Functions.

[BibT_eX]

[DOI]

Proceedings of the Computational Learning Theory, 2001

On the Comparison of Inductive Inference Criteria for Uniform Learning of Finite Classes.

[BibT_eX]

[DOI]