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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Zustand: New. In English. Artikel-Nr. ria9783540251767_new
Anzahl: Mehr als 20 verfügbar
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Artikel-Nr. 9783540251767
Anzahl: 1 verfügbar