365 search results - page 9 / 73 » An Approach to Multiply Segmented Constraint Satisfaction Pr... |
124
click to vote
AAAI
2000
15 years 4 months ago
2000
We shed light on the connections between different approaches to constraint satisfaction by showing that the main consistency concepts used to derive tractability results for cons...
122
Voted
CCR
2004
15 years 3 months ago
2004
Today's networking community is becoming increasingly skeptical of the significance of research results founded wholly upon experimental results conducted in simulation. Now, ...
151
Voted
LICS
2010
IEEE
15 years 1 months ago
2010
IEEE
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...
154
click to vote
AISC
2004
Springer
15 years 8 months ago
2004
Springer
Nonlinear constraint systems can be solved by combining consistency techniques and search. In this approach, the search space is reduced using local reasoning on constraints. Howev...
120
Voted
ICCD
2007
IEEE
16 years 11 days ago
2007
IEEE
We present new techniques for explicit constraint satisfaction in the incremental placement process. Our algorithm employs a Lagrangian Relaxation (LR) type approach in the analyt...