Principles and Practice of Constraint Programming - CP 2000: 6th International Conference, CP 2000 Singapore, September 18-21, 2000 Proceedings: Lecture Notes in Computer Science, cartea 1894
Editat de Rina Dechteren Limba Engleză Paperback – 6 sep 2000
Din seria Lecture Notes in Computer Science
- 20% Preț: 297.45 lei
- 20% Preț: 297.45 lei
- 20% Preț: 517.29 lei
- 5% Preț: 343.06 lei
- 20% Preț: 241.52 lei
- 20% Preț: 303.27 lei
- 20% Preț: 624.06 lei
- 20% Preț: 296.89 lei
- Preț: 346.79 lei
- Preț: 340.83 lei
- 20% Preț: 379.02 lei
- 20% Preț: 221.75 lei
- 20% Preț: 275.91 lei
- Preț: 262.38 lei
- 20% Preț: 298.57 lei
- 20% Preț: 266.97 lei
- 20% Preț: 360.10 lei
- 20% Preț: 310.09 lei
- 20% Preț: 284.43 lei
- 20% Preț: 308.00 lei
- 20% Preț: 202.42 lei
- 20% Preț: 283.35 lei
- 20% Preț: 315.25 lei
- 20% Preț: 572.84 lei
- 20% Preț: 475.27 lei
- 20% Preț: 291.91 lei
- 20% Preț: 289.52 lei
- 20% Preț: 290.45 lei
- 20% Preț: 698.69 lei
- 20% Preț: 347.90 lei
- 20% Preț: 413.13 lei
- 17% Preț: 338.16 lei
- 20% Preț: 771.51 lei
- 20% Preț: 447.62 lei
- 20% Preț: 298.57 lei
- 20% Preț: 287.43 lei
- 20% Preț: 414.27 lei
- 20% Preț: 413.75 lei
- 20% Preț: 639.35 lei
- 20% Preț: 267.73 lei
- 20% Preț: 322.75 lei
- 20% Preț: 297.58 lei
- 20% Preț: 367.40 lei
- 20% Preț: 607.93 lei
- 20% Preț: 297.58 lei
- 20% Preț: 377.31 lei
- 20% Preț: 289.95 lei
- 20% Preț: 418.32 lei
- 20% Preț: 345.69 lei
Preț: 643.84 lei
Preț vechi: 804.79 lei
-20%
Puncte Express: 966
Preț estimativ în valută:
123.35€ • 133.61$ • 105.78£
123.35€ • 133.61$ • 105.78£
Carte tipărită la comandă
Livrare economică 06-13 mai
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540410539
ISBN-10: 3540410538
Pagini: 580
Ilustrații: XII, 564 p.
Dimensiuni: 155 x 235 x 30 mm
Greutate: 1.76 kg
Ediția:2000
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540410538
Pagini: 580
Ilustrații: XII, 564 p.
Dimensiuni: 155 x 235 x 30 mm
Greutate: 1.76 kg
Ediția:2000
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited Papers.- Constraint-Based Agents: The ABC’s of CBA’s.- Constraints for Interactive Graphical Applications.- Meta-complexity Theorems: Talk Abstract.- Regular Papers.- Automatic Generation of Propagation Rules for Finite Domains.- Extending Forward Checking.- Global Constraints as Graph Properties on a Structured Network of Elementary Constraints of the Same Type.- Universally Quantified Interval Constraints.- Constraint Propagation for Soft Constraints: Generalization and Termination Conditions.- Constraints Inference Channels and Secure Databases.- Refinements and Independence: A Simple Method for Identifying Tractable Disjunctive Constraints.- A Language for Audiovisual Template Specification and Recognition.- Random 3-SAT: The Plot Thickens.- New Tractable Classes from Old.- Expressiveness of Full First Order Constraints in the Algebra of Finite or Infinite Trees.- Cutting Planes in Constraint Programming: An Hybrid Approach.- A Constraint-Based Framework for Prototyping Distributed Virtual Applications.- A Scalable Linear Constraint Solver for User Interface Construction.- A Constraint Programming Approach for Solving Rigid Geometric Systems.- Maintaining Arc-Consistency within Dynamic Backtracking.- New Search Heuristics for Max-CSP.- Analysis of Random Noise and Random Walk Algorithms for Satisfiability Testing.- Boosting Search with Variable Elimination.- Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint.- Practical Investigation of Constraints with Graph Views.- A Hybrid Search Architecture Applied to Hard Random 3-SAT and Low-Autocorrelation Binary Sequences.- Singleton Consistencies.- Linear Formulation of Constraint Programming Models and Hybrid Solvers.- A Global Constraint Combining a Sum Constraint and Difference Constraints.- Efficient Querying of Periodic Spatiotemporal Objects.- Arc Consistency for Soft Constraints.- Optimal Anytime Constrained Simulated Annealing for Constrained Global Optimization.- SAT v CSP.- Instruction Scheduling with Timing Constraints on a Single RISC Processor with 0/1 Latencies.- Arc Consistency on n-ary Monotonic and Linear Constraints.- Poster Papers.- Some Observations on Durations, Scheduling and Allen’s Algebra.- Using Randomization and Learning to Solve Hard Real-World Instances of Satisfiability.- Finding Minimal Unsatisfiable Subformulae in Satisfiability Instances.- Branching Constraint Satisfaction Problems for Solutions Robust under Likely Changes.- Constraint Propagation: Between Abstract Models and ad hoc Strategies.- How to Model and Verify Concurrent Algorithms for Distributed CSPs.- The Phase Transition in Distributed Constraint Satisfaction Problems: First Results.- Cooperating Constraint Solvers.- An Empirical Study of Probabilistic Arc Consistency as a Variable Ordering Heuristic.- On Dual Encodings for Non-binary Constraint Satisfaction Problems.- Algebraic Simplification Techniques for Propositional Satisfiability.- An Original Constraint Based Approach for Solving over Constrained Problems.- An Efficient Approximate Algorithm for Winner Determination in Combinatorial Auctions.
Caracteristici
Includes supplementary material: sn.pub/extras