Recent Advances in Constraints
Joint ERCIM/CoLogNET International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2004, Lausanne, Switzerland, June 23-25, 2004, Revised Selected and Invited Papers
Taschenbuch
BOD - 2 Tage | Lieferzeit: BOD - 2 Tage I
56,79 €*
Alle Preise inkl. MwSt.| Versandkostenfrei
Sicherheits- und Produktressourcen
Bilder und Kontakte
Sicherheitsbilder- und Kontakte
Artikelnummer:
9783540251767
Veröffentlichungsdatum:
2005
Einband:
Taschenbuch
Erscheinungsdatum:
08.03.2005
Seiten:
232
Autor:
Adrian Petcu
Gewicht:
359 g
Format:
235x155x13 mm
Serie:
Lecture Notes in Computer Science
Serientitel:
Libri, Lecture Notes in Computer Science, 01, 01
Sprache:
Englisch
Langbeschreibung
Constraint Propagation.- GCC-Like Restrictions on the Same Constraint.- A Note on Bilattices and Open Constraint Programming.- Pruning by Equally Constrained Variables.- Search.- Trying Again to Fail-First.- Characterization of a New Restart Strategy for Randomized Backtrack Search.- Dynamic Distributed BackJumping.- A Value Ordering Heuristic for Local Search in Distributed Resource Allocation.- Automatically Exploiting Symmetries in Constraint Programming.- New Structural Decomposition Techniques for Constraint Satisfaction Problems.- Applications.- Algorithms for the Maximum Hamming Distance Problem.- A System Prototype for Solving Multi-granularity Temporal CSP.- Computing Equilibria Using Interval Constraints.- Constraint-Based Approaches to the Covering Test Problem.- Super Solutions for Combinatorial Auctions.- Better Propagation for Non-preemptive Single-Resource Constraint Problems.
Hauptbeschreibung
Includes supplementary material: sn.pub/extras
Inhaltsverzeichnis
Constraint Propagation.- GCC-Like Restrictions on the Same Constraint.- A Note on Bilattices and Open Constraint Programming.- Pruning by Equally Constrained Variables.- Search.- Trying Again to Fail-First.- Characterization of a New Restart Strategy for Randomized Backtrack Search.- Dynamic Distributed BackJumping.- A Value Ordering Heuristic for Local Search in Distributed Resource Allocation.- Automatically Exploiting Symmetries in Constraint Programming.- New Structural Decomposition Techniques for Constraint Satisfaction Problems.- Applications.- Algorithms for the Maximum Hamming Distance Problem.- A System Prototype for Solving Multi-granularity Temporal CSP.- Computing Equilibria Using Interval Constraints.- Constraint-Based Approaches to the Covering Test Problem.- Super Solutions for Combinatorial Auctions.- Better Propagation for Non-preemptive Single-Resource Constraint Problems.