920 search results - page 155 / 184 » Generating Satisfiable Problem Instances |
AMAI
1999
Springer
13 years 7 months ago
1999
Springer
Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is interesting because it bring advantages of logic prog...
AIPS
2010
13 years 10 months ago
2010
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract-- Despite of advances in machine learning technologies, a schema matching result between two database schemas (e.g., those derived from COMA++) is likely to be imprecise. ...
ECP
1997
Springer
13 years 12 months ago
1997
Springer
In this paper we describe SINERGY, which is a highly parallelizable, linear planning system that is based on the genetic programming paradigm. Rather than reasoning about the world...
ECCV
2004
Springer
14 years 1 months ago
2004
Springer
3D reconstruction from image data is required in many medical procedures. Recently, the use of fluoroscopy data to generate these 3D models has been explored. Most existing methods...