1027 search results - page 96 / 206 » Comparing Search Algorithms for the Temperature Inversion Pr... |
CORR
1999
Springer
13 years 8 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
PAAMS
2010
Springer
14 years 2 months ago
2010
Springer
In this paper, we introduce a new heuristic search algorithm based on mean values for anytime planning, called MHSP. It consists in associating the principles of UCT, a bandit-base...
AMAI
2004
Springer
14 years 2 months ago
2004
Springer
Recent dynamic local search (DLS) algorithms such as SAPS are amongst the state-of-the-art methods for solving the propositional satisfiability problem (SAT). DLS algorithms modi...
EDBT
2009
ACM
14 years 4 months ago
2009
ACM
Adapting keyword search to XML data has been attractive recently, generalized as XML keyword search (XKS). One of its key tasks is to return the meaningful fragments as the result...
IJCAI
1989
13 years 10 months ago
1989
A constraint satisfiability problem consists of a set of variables, their associated domains (i.e., the set of values the variable can take) and a set of constraints on these vari...