Search Sciweavers | Sciweavers

Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...

Richard J. Wallace

claim paper

Read More »

168

click to vote

AAAI
1994

91views Intelligent Agents» more AAAI 1994»

Weak-Commitment Search for Solving Constraint Satisfaction Problems

15 years 7 months ago

Download www.aaai.org

Makoto Yokoo

claim paper

Read More »

113

click to vote

GECCO
2008
Springer

95views Optimization» more GECCO 2008»

Hyper-heuristics for the dynamic variable ordering in constraint satisfaction problems

15 years 7 months ago

Download www.cs.bham.ac.uk

Hugo Terashima-Marín, José Carlos Or...

claim paper

Read More »

129

Voted

AI
2007
Springer

109views Artificial Intelligence» more AI 2007»

Random constraint satisfaction: Easy generation of hard (satisfiable) instances

15 years 6 months ago

Sciweavers

Explore & Download

Productivity Tools

Sciweavers