Sciweavers

6095 search results - page 171 / 1219
» Learning in Local Search
Sort
View
AAAI
1996
13 years 11 months ago
Formalizing Dependency Directed Backtracking and Explanation Based Learning in Refinement Search
The ideas of dependency directed backtracking (DDB) and explanation based learning (EBL) have developed independently in constraint satisfaction, planning and problem solving comm...
Subbarao Kambhampati
SAT
2004
Springer
88views Hardware» more  SAT 2004»
14 years 3 months ago
Improving First-order Model Searching by Propositional Reasoning and Lemma Learning
The finite model generation problem in the first-order logic is a generalization of the propositional satisfiability (SAT) problem. An essential algorithm for solving the proble...
Zhuo Huang, Hantao Zhang, Jian Zhang
ICRA
2008
IEEE
119views Robotics» more  ICRA 2008»
14 years 4 months ago
Towards schema-based, constructivist robot learning: Validating an evolutionary search algorithm for schema chunking
— In this paper, we lay the groundwork for extending our previously developed ASyMTRe architecture to enable constructivist learning for multi-robot team tasks. The ASyMTRe archi...
Yifan Tang, Lynne E. Parker
CIKM
2008
Springer
14 years 3 days ago
Are click-through data adequate for learning web search rankings?
Learning-to-rank algorithms, which can automatically adapt ranking functions in web search, require a large volume of training data. A traditional way of generating training examp...
Zhicheng Dou, Ruihua Song, Xiaojie Yuan, Ji-Rong W...
CIKM
2011
Springer
12 years 10 months ago
Learning to aggregate vertical results into web search results
Aggregated search is the task of integrating results from potentially multiple specialized search services, or verticals, into the Web search results. The task requires predicting...
Jaime Arguello, Fernando Diaz, Jamie Callan