1381 search results - page 70 / 277 » Computational Complexity of Constraint Satisfaction |
119
Voted
TCAD
2008
15 years 3 months ago
2008
Abstract--Recent analytical global placers use density constraints to approximate nonoverlap constraints, and these show very successful results. This paper unifies a wide range of...
161
click to vote
AAAI
2006
15 years 5 months ago
2006
DTGolog, a decision-theoretic agent programming language based on the situation calculus, was proposed to ease some of the computational difficulties associated with Markov Decisi...
152
click to vote
EAAI
2008
15 years 4 months ago
2008
: In real life scenarios there is often the need for modelling conditional plans where external events determgine the actual execution sequence. Conditional Temporal Problems (CTPs...
137
click to vote
CPAIOR
2007
Springer
15 years 10 months ago
2007
Springer
The Open-Shop Problem is a hard problem that can be solved using Constraint Programming or Operation Research methods. Existing techniques are efficient at reducing the search tree...
136
click to vote
CVPR
2005
IEEE
16 years 6 months ago
2005
IEEE
We propose a solution to the n-frame correspondence problem under the factorization framework. During the matching process, our algorithm takes explicitly into account the geometr...