97 search results - page 7 / 20 » Using Generalized Constraints and Protoforms to Deal with Ad... |
FLAIRS
2004
13 years 8 months ago
2004
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
CONSTRAINTS
2007
13 years 7 months ago
2007
In this paper we present Cardinal, a general finite sets constraint solver just made publicly available in ECLiPSe Prolog, suitable for combinatorial problem solving by exploiting ...
CSCLP
2008
Springer
13 years 9 months ago
2008
Springer
In the analysis of hybrid discrete-continuous systems, rich arithmetic constraint formulae with complex Boolean structure arise naturally. The iSAT algorithm, a solver for such for...
GIS
2006
ACM
13 years 7 months ago
2006
ACM
Currently, most of the operations performed for the construction of marine charts are still done manually. However, with the development of more and more powerful techniques, new ...
ANOR
2002
13 years 7 months ago
2002
A new algorithm for solving smooth large-scale minimization problems with bound constraints is introduced. The way of dealing with active constraints is similar to the one used in...