Sciweavers

1483 search results - page 12 / 297
» Geometric constraint satisfaction using optimization methods
Sort
View
JCSS
2008
107views more  JCSS 2008»
13 years 11 months ago
A unified theory of structural tractability for constraint satisfaction problems
In this paper we derive a generic form of structural decomposition for the constraint satisfaction problem, which we call a guarded decomposition. We show that many existing decom...
David A. Cohen, Peter Jeavons, Marc Gyssens
GECCO
2004
Springer
284views Optimization» more  GECCO 2004»
14 years 4 months ago
Lagrange Multiplier Method for Multi-campaign Assignment Problem
It is crucial to maximize marketing efficiency and customer satisfaction in personalized marketing. In this paper, we raise the multiple recommendation problem which occurs when pe...
Yong-Hyuk Kim, Byung Ro Moon
AMAI
1999
Springer
13 years 10 months ago
Maintenance scheduling problems as benchmarks for constraint algorithms
The paper focuses on evaluating constraint satisfaction search algorithms on application based random problem instances. The application we use is a well-studied problem in the el...
Daniel Frost, Rina Dechter
WSCG
2000
110views more  WSCG 2000»
14 years 7 days ago
Using 3D Geometric Constraints in Architectural Design Support Systems
To support 3D architectural modeling, geometric constraints are introduced. Explicit and implicit geometric relations between building elements can be expressed by the designer an...
Bert de Vries, A. J. Jessurun, Richard H. M. C. Ke...
CP
2005
Springer
14 years 4 months ago
Caching Search States in Permutation Problems
When the search for a solution to a constraint satisfaction problem backtracks, it is not usually worthwhile to remember the assignment that failed, because the same assignment wil...
Barbara M. Smith