1971 search results - page 125 / 395 » Tabu search - Uncharted domains |
133
click to vote
ECAI
1998
Springer
15 years 10 months ago
1998
Springer
Knowledge about forced moves enables to select a small number of moves from the set of possible moves. It is very important in complex domains where search trees have a large branc...
160
click to vote
IJCAI
2003
15 years 7 months ago
2003
A promising technique used in some planning systems to improve their performance is the use of domain dependent search control knowledge. We present a procedure for compiling sear...
178
click to vote
SIGSOFT
2009
ACM
16 years 7 months ago
2009
ACM
Search computing is a novel discipline whose goal is to answer complex, multi-domain queries. Such queries typically require combining in their results domain knowledge extracted ...
173
click to vote
KI
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. Due to its prominence in artificial intelligence and theoretical computer science, the propositional satisfiability problem (SAT) has received considerable attention in...
170
click to vote
CG
2006
Springer
15 years 10 months ago
2006
Springer
In the last decade, proof-number search and Monte-Carlo methods have successfully been applied to the combinatorial-games domain. Proof-number search is a reliable algorithm. It re...