Sciweavers

80 search results - page 7 / 16
» Cube Pruning as Heuristic Search
Sort
View
HEURISTICS
2002
146views more  HEURISTICS 2002»
13 years 7 months ago
Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows
This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint pr...
Louis-Martin Rousseau, Michel Gendreau, Gilles Pes...
ICDE
2008
IEEE
194views Database» more  ICDE 2008»
14 years 9 months ago
P-Cube: Answering Preference Queries in Multi-Dimensional Space
Many new applications that involve decision making need online (i.e., OLAP-styled) preference analysis with multidimensional boolean selections. Typical preference queries includes...
Dong Xin, Jiawei Han
CORR
2010
Springer
179views Education» more  CORR 2010»
13 years 6 months ago
Active Testing for Face Detection and Localization
—We provide a novel search technique which uses a hierarchical model and a mutual information gain heuristic to efficiently prune the search space when localizing faces in images...
Raphael Sznitman, Bruno Jedynak
ACG
2003
Springer
14 years 1 months ago
Monte-Carlo Go Developments
We describe two Go programs,  ¢¡¤£¦¥ and  ¢¡¤§¨£ , developed by a Monte-Carlo approach that is simpler than Bruegmann’s (1993) approach. Our method is based on Abra...
Bruno Bouzy, Bernard Helmstetter
CP
2004
Springer
14 years 1 months ago
Counting-Based Look-Ahead Schemes for Constraint Satisfaction
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...
Kalev Kask, Rina Dechter, Vibhav Gogate