73 search results - page 10 / 15 » A Landscape Analysis of Constraint Satisfaction Problems |
COMPULOG
1999
Springer
15 years 2 months ago
1999
Springer
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints...
AIPS
2000
14 years 11 months ago
2000
Currently, Graphplan and Blackbox, which converts Graphplan's plan graph into the satisfaction (SAT) problem, are two of the most successful planners. Since Graphplan gains i...
110
click to vote
GIS
1995
ACM
15 years 1 months ago
1995
ACM
: Usually spatial planning problems involve a large number of decision makers with different backgrounds and interests. The process of Collaborative Spatial Decision Making (CSDM)...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
ISDA
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract--In business analysis, models are sometimes oversimplified. We pragmatically approach many problems with a single financial objective and include monetary values for non-m...