Abstraction, Reformulation, and Approximation: 7th International Symposium, SARA 2007, Whistler, Canada, July 18-21, 2007, Proceedings: Lecture Notes in Computer Science, cartea 4612
Editat de Ian Miguel, Wheeler Tumlen Limba Engleză Paperback – 4 iul 2007
Din seria Lecture Notes in Computer Science
- 20% Preț: 1040.03 lei
- 20% Preț: 333.46 lei
- 20% Preț: 335.08 lei
- 20% Preț: 444.17 lei
- 20% Preț: 238.01 lei
- 20% Preț: 333.46 lei
- 20% Preț: 438.69 lei
- Preț: 440.52 lei
- 20% Preț: 336.71 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 256.27 lei
- 20% Preț: 632.22 lei
- 17% Preț: 427.22 lei
- 20% Preț: 641.78 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1053.45 lei
- 20% Preț: 579.56 lei
- Preț: 373.56 lei
- 20% Preț: 330.23 lei
- 15% Preț: 429.74 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- Preț: 389.48 lei
- 20% Preț: 326.98 lei
- 20% Preț: 1386.07 lei
- 20% Preț: 1003.66 lei
- 20% Preț: 567.60 lei
- 20% Preț: 575.48 lei
- 20% Preț: 571.63 lei
- 20% Preț: 747.79 lei
- 15% Preț: 568.74 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 346.40 lei
- 20% Preț: 574.05 lei
- Preț: 402.62 lei
- 20% Preț: 584.40 lei
- 20% Preț: 747.79 lei
- 20% Preț: 809.19 lei
- 20% Preț: 649.49 lei
- 20% Preț: 343.16 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 335.56 lei
Preț vechi: 419.45 lei
-20% Nou
Puncte Express: 503
Preț estimativ în valută:
64.22€ • 66.71$ • 53.34£
64.22€ • 66.71$ • 53.34£
Carte tipărită la comandă
Livrare economică 03-17 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540735793
ISBN-10: 3540735798
Pagini: 434
Ilustrații: XI, 420 p.
Dimensiuni: 155 x 235 x 27 mm
Greutate: 0.69 kg
Ediția:2007
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540735798
Pagini: 434
Ilustrații: XI, 420 p.
Dimensiuni: 155 x 235 x 27 mm
Greutate: 0.69 kg
Ediția:2007
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited Talks (Abstracts).- State Abstraction in Real-Time Heuristic Search.- Abstraction and Reformulation in the Generation of Constraint Models.- A Framework for Integrating Optimization and Constraint Programming.- Research Papers.- DFS-Tree Based Heuristic Search.- Partial Pattern Databases.- CDB-PV: A Constraint Database-Based Program Verifier.- Generating Implied Boolean Constraints Via Singleton Consistency.- Reformulating Constraint Satisfaction Problems to Improve Scalability.- Reformulating Global Constraints: The Slide and Regular Constraints.- Relaxation of Qualitative Constraint Networks.- Dynamic Domain Abstraction Through Meta-diagnosis.- Channeling Abstraction.- Approximate Model-Based Diagnosis Using Greedy Stochastic Search.- Combining Perimeter Search and Pattern Database Abstractions.- Solving Satisfiability in Ground Logic with Equality by Efficient Conversion to Propositional Logic.- Tailoring Solver-Independent Constraint Models: A Case Study with Essence? and Minion.- A Meta-CSP Model for Optimal Planning.- Reformulation for Extensional Reasoning.- An Abstract Theory and Ontology of Motion Based on the Regions Connection Calculus.- Computing and Using Lower and Upper Bounds for Action Elimination in MDP Planning.- Model-Based Exploration in Continuous State Spaces.- Active Learning of Dynamic Bayesian Networks in Markov Decision Processes.- Boosting MUS Extraction.- Homogeneous Hierarchical Composition of Areas in Multi-robot Area Coverage.- Formalizing the Abstraction Process in Model-Based Diagnosis.- Boolean Approximation Revisited.- An Analysis of Map-Based Abstraction and Refinement.- Solving Difficult SAT Instances Using Greedy Clique Decomposition.- Abstraction and Complexity Measures.- Research Summaries.- Abstraction, Emergence, andThought.- What’s Your Problem? The Problem of Problem Definition.- A Reformulation-Based Approach to Explanation in Constraint Satisfaction.- Integration of Constraint Programming and Metaheuristics.- Rule-Based Reasoning Via Abstraction.- Extensional Reasoning.- Reformulating Constraint Models Using Input Data.- Using Analogy Discovery to Create Abstractions.- Distributed CSPs: Why It Is Assumed a Variable per Agent?.- Decomposition of Games for Efficient Reasoning.- Generalized Constraint Acquisition.- Using Infeasibility to Improve Abstraction-Based Heuristics.- Leveraging Graph Locality Via Abstraction.