Sciweavers

530 search results - page 100 / 106
» Learning Bounds for Domain Adaptation
Sort
View
GECCO
2009
Springer
14 years 10 days ago
NEAT in increasingly non-linear control situations
Evolution of neural networks, as implemented in NEAT, has proven itself successful on a variety of low-level control problems such as pole balancing and vehicle control. Nonethele...
Matthias J. Linhardt, Martin V. Butz
ATAL
2008
Springer
13 years 9 months ago
An approach to online optimization of heuristic coordination algorithms
Due to computational intractability, large scale coordination algorithms are necessarily heuristic and hence require tuning for particular environments. In domains where character...
Jumpol Polvichai, Paul Scerri, Michael Lewis
SAC
2009
ACM
14 years 2 months ago
Capturing truthiness: mining truth tables in binary datasets
We introduce a new data mining problem: mining truth tables in binary datasets. Given a matrix of objects and the properties they satisfy, a truth table identifies a subset of pr...
Clifford Conley Owens III, T. M. Murali, Naren Ram...
ICCBR
2009
Springer
14 years 2 months ago
Using Meta-reasoning to Improve the Performance of Case-Based Planning
Case-based planning (CBP) systems are based on the idea of reusing past successful plans for solving new problems. Previous research has shown the ability of meta-reasoning approac...
Manish Mehta, Santiago Ontañón, Ashw...
CICLING
2005
Springer
14 years 1 months ago
Incremental Information Extraction Using Tree-Based Context Representations
Abstract. The purpose of information extraction (IE) is to find desired pieces of information in natural language texts and store them in a form that is suitable for automatic pro...
Christian Siefkes