CP
2005
Springer
14 years 5 months ago
2005
Springer
We present a new and more efficient heuristic by restricting lookahead saturation (LAS) with NVO (neighbourhood variable ordering) and DEW (dynamic equality weighting). We report o...
CP
2005
Springer
14 years 5 months ago
2005
Springer
This paper describes an efficient, complete approach for solving a complex allocation and scheduling problem for Multi-Processor System-on-Chip (MPSoC). Given a throughput constra...
CP
2005
Springer
14 years 5 months ago
2005
Springer
Abstract. This report presents a basic scheme for deriving systematically a filtering algorithm from the graph properties based representation of global constraints. This scheme i...
CP
2005
Springer
14 years 5 months ago
2005
Springer
Abstract. This article presents a database of about 200 graph invariants for deriving systematically necessary conditions from the graph properties based representation of global c...
CP
2005
Springer
14 years 5 months ago
2005
Springer
Local search is a powerful and well-established method for solving hard combinatorial problems. Yet, until recently, it has provided very little user support, leading to time-consu...
CP
2005
Springer
14 years 5 months ago
2005
Springer
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
CP
2005
Springer
14 years 5 months ago
2005
Springer