Sciweavers

717 search results - page 51 / 144
» Weak-Commitment Search for Solving Constraint Satisfaction P...
Sort
View
CP
2007
Springer
15 years 4 months ago
Breaking Value Symmetry
Symmetry is an important factor in solving many constraint satisfaction problems. One common type of symmetry is when we have symmetric values. We can eliminate such value symmetr...
Toby Walsh
TWC
2008
158views more  TWC 2008»
14 years 9 months ago
Solving Box-Constrained Integer Least Squares Problems
A box-constrained integer least squares problem (BILS) arises from several wireless communications applications. Solving a BILS problem usually has two stages: reduction (or prepro...
Xiao-Wen Chang, Qing Han
ESWA
2007
100views more  ESWA 2007»
14 years 9 months ago
Using memetic algorithms with guided local search to solve assembly sequence planning
The goal of assembly planning consists in generating feasible sequences to assemble a product and selecting an efficient assembly sequence from which related constraint factors su...
Hwai-En Tseng, Wen-Pai Wang, Hsun-Yi Shih
CP
2001
Springer
15 years 2 months ago
Optimal Pruning in Parametric Differential Equations
Initial value problems for parametric ordinary differential equations (ODEs) arise in many areas of science and engineering. Since some of the data is uncertain, traditional numer...
Micha Janssen, Pascal Van Hentenryck, Yves Deville
JAIR
2007
95views more  JAIR 2007»
14 years 9 months ago
Consistency and Random Constraint Satisfaction Models
In this paper, we study the possibility of designing non-trivial random CSP models by exploiting the intrinsic connection between structures and typical-case hardness. We show tha...
Yong Gao, Joseph C. Culberson