Search Sciweavers | Sciweavers

36

CP
2010
Springer

136views Artificial Intelligence» more CP 2010»

Towards Parallel Non Serial Dynamic Programming for Solving Hard Weighted CSP

13 years 7 months ago

We introduce a parallelized version of tree-decomposition based dynamic programming for solving difficult weighted CSP instances on many cores. A tree decomposition organizes cost ...

David Allouche, Simon de Givry, Thomas Schiex

claim paper

Read More »

31

click to vote

AAAI
1997

130views Intelligent Agents» more AAAI 1997»

Using CSP Look-Back Techniques to Solve Real-World SAT Instances

13 years 11 months ago

Download www.bayardo.org

We report on the performance of an enhanced version of the “Davis-Putnam” (DP) proof procedure for propositional satisfiability (SAT) on large instances derived from realworld...

Roberto J. Bayardo Jr., Robert Schrag

claim paper

Read More »

24

click to vote

CP
2005
Springer

147views Artificial Intelligence» more CP 2005»

Solving the Car-Sequencing Problem as a Non-binary CSP

14 years 3 months ago

Download lia.deis.unibo.it

A search algorithm based on non-binary forward checking (nFC) is used to solve the car-sequencing problem. The choice of value ordering heuristics having a dramatic eﬀect on solu...

Mihaela Butaru, Zineb Habbas

claim paper

Read More »

36

click to vote

CSCLP
2004
Springer

118views Artificial Intelligence» more CSCLP 2004»

A System Prototype for Solving Multi-granularity Temporal CSP

14 years 3 months ago

Download liawww.epfl.ch

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

claim paper

Read More »

16

click to vote

CP
2005
Springer

87views Artificial Intelligence» more CP 2005»

Statistical Modelling of CSP Solving Algorithms Performance

14 years 3 months ago

Download lia.deis.unibo.it

Ramón Béjar, Cèsar Fern&aacut...

claim paper