2109 search results - page 17 / 422 » Solving Necklace Constraint Problems |
196
click to vote
CSCLP
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Time granularity constraint reasoning is likely to have a relevant role in emerging applications like GIS, time management in the Web and Personal Information Management ...
159
click to vote
CCS
2001
ACM
15 years 10 months ago
2001
ACM
The reachability problem for cryptographic protocols with nonatomic keys can be solved via a simple constraint satisfaction procedure.
158
click to vote
GECCO
2007
Springer
16 years 1 days ago
2007
Springer
In this paper, we propose the combination of different optimization techniques in order to solve “hard” two- and threeobjective optimization problems at a relatively low comp...
171
click to vote
IJCAI
2003
15 years 7 months ago
2003
We present an algorithm Pref-AC that limits arc consistency (AC) to the preferred choices of a tree search procedure and that makes constraint solving more efficient without chan...
146
click to vote
CAD
2006
Springer
15 years 6 months ago
2006
Springer
In this paper, we propose a method which can be used to decompose a 2D or 3D constraint problem into a C-tree. With this decomposition, a geometric constraint problem can be reduc...