Sciweavers

532 search results - page 68 / 107
» Tree exploration with advice
Sort
View
IJCAI
2001
13 years 9 months ago
Backtracking Through Biconnected Components of a Constraint Graph
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
Jean-François Baget, Yannic S. Tognetti
AAAI
1994
13 years 9 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
CONSTRAINTS
2010
101views more  CONSTRAINTS 2010»
13 years 7 months ago
Evaluating the impact of AND/OR search on 0-1 integer linear programming
AND/OR search spaces accommodate advanced algorithmic schemes for graphical models which can exploit the structure of the model. We extend and evaluate the depth-first and best-fi...
Radu Marinescu 0002, Rina Dechter
IJDMMM
2008
72views more  IJDMMM 2008»
13 years 7 months ago
Mining event histories: a social science perspective
We explore how recent data-mining-based tools developed in domains such as biomedicine or text-mining for extracting interesting knowledge from sequence data could be applied to pe...
Gilbert Ritschard, Alexis Gabadinho, Nicolas S. M&...
GIS
2006
ACM
13 years 7 months ago
Swarming methods for geospatial reasoning
Geospatial data is often used to predict or recommend movements of robots, people, or animals ("walkers"). Analysis of such systems can be combinatorially explosive. Eac...
H. Van Dyke Parunak, Sven Brueckner, Robert S. Mat...