Sciweavers

1568 search results - page 188 / 314
» The problem of examination questions in algorithmics
Sort
View
AIPS
2006
15 years 7 months ago
Learning to Do HTN Planning
We describe HDL, an algorithm that learns HTN domain descriptions by examining plan traces produced by an expert problem-solver. Prior work on learning HTN methods requires that a...
Okhtay Ilghami, Dana S. Nau, Héctor Mu&ntil...
GVD
2004
107views Database» more  GVD 2004»
15 years 7 months ago
Conflation Methods and Spelling Mistakes - A Sensitivity Analysis in Information Retrieval
In some information retrieval scenarios, for example internal help desk systems, texts are entered into the document collection without proofreading. This can result in a relative...
Philipp Dopichaj, Theo Härder
IJCAI
1997
15 years 7 months ago
Learning to Improve both Efficiency and Quality of Planning
Most research in learning for planning has concentrated on efficiency gains. Another important goal is improving the quality of final plans. Learning to improve plan quality has b...
Tara A. Estlin, Raymond J. Mooney
AAAI
1994
15 years 7 months ago
Evolving Neural Networks to Focus Minimax Search
Neural networks were evolved through genetic algorithms to focus minimax search in the game of Othello. At each level of the search tree, the focus networks decide which moves are...
David E. Moriarty, Risto Miikkulainen
ICASSP
2010
IEEE
15 years 6 months ago
Learning from high-dimensional noisy data via projections onto multi-dimensional ellipsoids
In this paper, we examine the problem of learning from noisecontaminated data in high-dimensional space. A new learning approach based on projections onto multi-dimensional ellips...
Liuling Gong, Dan Schonfeld