Sciweavers

417 search results - page 33 / 84
» In Search of the Best Constraint Satisfaction Search
Sort
View
CONSTRAINTS
2007
100views more  CONSTRAINTS 2007»
14 years 9 months ago
Design of Financial CDO Squared Transactions Using Constraint Programming
We give an approximate and often extremely fast method of building a particular kind of portfolio in finance, here called a portfolio design (PD), with applications in the credit ...
Pierre Flener, Justin Pearson, Luis G. Reyna, Olof...
AUSAI
2006
Springer
15 years 1 months ago
Finite Domain Bounds Consistency Revisited
A widely adopted approach to solving constraint satisfaction problems combines systematic tree search with constraint propagation for pruning the search space. Constraint propagati...
Chiu Wo Choi, Warwick Harvey, J. H. M. Lee, Peter ...
SAC
2003
ACM
15 years 3 months ago
Coordination-Based Distributed Constraint Solving in DICE
DICE (DIstributed Constraint Environment) is a framework for the construction of distributed constraint solvers from software components in a number of predefined categories. The...
Peter Zoeteweij
SGAI
2007
Springer
15 years 3 months ago
Escaping Local Optima: Constraint Weights vs. Value Penalties
Constraint Satisfaction Problems can be solved using either iterative improvement or constructive search approaches. Iterative improvement techniques converge quicker than the cons...
Muhammed Basharu, Inés Arana, Hatem Ahriz
CP
2007
Springer
15 years 4 months ago
Min-Domain Ordering for Asynchronous Backtracking
Ordering heuristics are a powerful tool in CSP search algorithms. Among the most successful ordering heuristics are heuristics which enforce a fail first strategy by using the mi...
Roie Zivan, Moshe Zazone, Amnon Meisels