Sciweavers

1516 search results - page 18 / 304
» The Increasing Nvalue Constraint
Sort
View
ISMVL
2009
IEEE
96views Hardware» more  ISMVL 2009»
15 years 4 months ago
Evaluation of Cardinality Constraints on SMT-Based Debugging
For formal verification of hardware Satisfiability Modulo Theory (SMT) solvers are increasingly applied. Today’s state-of-the-art SMT solvers use different techniques like ter...
André Sülflow, Robert Wille, Görs...
ICLP
2007
Springer
15 years 3 months ago
Universal Timed Concurrent Constraint Programming
Abstract In this doctoral work we aim at developing a rich timed concurrent constraint (tcc) based language with strong ties to logic. The new calculus called Universal Timed Concu...
Carlos Olarte, Catuscia Palamidessi, Frank Valenci...
AIPS
2008
14 years 12 months ago
Using Constraint Networks on Timelines to Model and Solve Planning and Scheduling Problems
In the last decades, there has been an increasing interest in the connection between planning and constraint programming. Several approaches were used, leading to different forms ...
Cédric Pralet, Gérard Verfaillie
JAIR
2006
131views more  JAIR 2006»
14 years 9 months ago
Asynchronous Partial Overlay: A New Algorithm for Solving Distributed Constraint Satisfaction Problems
Distributed Constraint Satisfaction (DCSP) has long been considered an important problem in multi-agent systems research. This is because many real-world problems can be represent...
Roger Mailler, Victor R. Lesser
HEURISTICS
2002
146views more  HEURISTICS 2002»
14 years 9 months ago
Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows
This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint pr...
Louis-Martin Rousseau, Michel Gendreau, Gilles Pes...