Abstraction, Reformulation, and Approximation
Editat de Ian Miguel, Wheeler Tumlen Limba Engleză Paperback – 4 iul 2007
Preț: 327.92 lei
Preț vechi: 409.90 lei
-20% Nou
Puncte Express: 492
Preț estimativ în valută:
58.02€ • 67.69$ • 50.72£
58.02€ • 67.69$ • 50.72£
Carte tipărită la comandă
Livrare economică 16-30 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540735793
ISBN-10: 3540735798
Pagini: 432
Ilustrații: XI, 420 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.65 kg
Ediția:2007
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540735798
Pagini: 432
Ilustrații: XI, 420 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.65 kg
Ediția:2007
Editura: Springer
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.