6095 search results - page 279 / 1219 » Learning in Local Search |
162
click to vote
IJCNN
2007
IEEE
16 years 28 days ago
2007
IEEE
— Solvers for the Boolean satisfiability problem are an important base technology for many applications. The most efficient SAT solvers for industrial applications are based on...
161
click to vote
AIPS
2008
15 years 9 months ago
2008
Planning problems are often formulated as heuristic search. The choice of the heuristic function plays a significant role in the performance of planning systems, but a good heuris...
171
click to vote
AAAI
1994
15 years 8 months ago
1994
We describe a method for learning formulas in firstorder logic using a brute-force, smallest-first search. The method is exceedingly simple. It generates all irreducible well-form...
173
click to vote
DSS
2008
15 years 6 months ago
2008
While small-scale search engines in specific domains and languages are increasingly used by Web users, most existing search engine development tools do not support the development...
169
click to vote
IUI
2005
ACM
16 years 5 days ago
2005
ACM
We present PLIANT, a learning system that supports adaptive assistance in an open calendaring system. PLIANT learns user preferences from the feedback that naturally occurs during...