Sciweavers

810 search results - page 130 / 162
» Solving Time-Dependent Planning Problems
Sort
View
AMAI
2004
Springer
14 years 1 months ago
New Look-Ahead Schemes for Constraint Satisfaction
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
Kalev Kask, Rina Dechter, Vibhav Gogate
GECCO
2010
Springer
214views Optimization» more  GECCO 2010»
13 years 11 months ago
Mixed-integer evolution strategy using multiobjective selection applied to warehouse design optimization
This paper reports about the application of a new variant of multiobjective Mixed-Integer Evolution Strategy to a warehouse design optimization problem. The algorithm is able to d...
Edgar Reehuis, Thomas Bäck
AAAI
2004
13 years 9 months ago
SOFIA's Choice: An AI Approach to Scheduling Airborne Astronomy Observations
We describe an innovative solution to the problem of scheduling astronomy observations for the Stratospheric Observatory for Infrared Astronomy, an airborne observatory. The probl...
Jeremy Frank, Michael A. K. Gross, Elif Kürkl...
ECCC
2007
99views more  ECCC 2007»
13 years 7 months ago
An Exponential Time/Space Speedup For Resolution
Satisfiability algorithms have become one of the most practical and successful approaches for solving a variety of real-world problems, including hardware verification, experime...
Philipp Hertel, Toniann Pitassi
WWW
2008
ACM
14 years 8 months ago
Exploiting semantic web technologies to model web form interactions
Form mapping is the key problem that needs to be solved in order to get access to the hidden web. Currently available solutions for fully automatic mapping are not ready for comme...
Bernhard Krüpl, Robert Baumgartner, Wolfgang ...