Sciweavers

2109 search results - page 17 / 422
» Solving Necklace Constraint Problems
Sort
View
CSCLP
2004
Springer
15 years 7 months ago
A System Prototype for Solving Multi-granularity Temporal CSP
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 ...
Claudio Bettini, Sergio Mascetti, Vincenzo Pupillo
CCS
2001
ACM
15 years 6 months ago
Constraint solving for bounded-process cryptographic protocol analysis
The reachability problem for cryptographic protocols with nonatomic keys can be solved via a simple constraint satisfaction procedure.
Jonathan K. Millen, Vitaly Shmatikov
102
Voted
GECCO
2007
Springer
161views Optimization» more  GECCO 2007»
15 years 8 months ago
Alternative techniques to solve hard multi-objective optimization problems
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...
Ricardo Landa Becerra, Carlos A. Coello Coello, Al...
IJCAI
2003
15 years 3 months ago
Propagate the Right Thing: How Preferences Can Speed-Up Constraint Solving
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...
Christian Bessière, Anaïs Fabre, Ulric...
CAD
2006
Springer
15 years 1 months ago
A C-tree decomposition algorithm for 2D and 3D geometric constraint solving
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...
Xiao-Shan Gao, Qiang Lin, Gui-Fang Zhang