Custom cover image
Custom cover image

Abstraction, Reformulation, and Approximation : 7th International Symposium, SARA 2007, Whistler, Canada, July 18-21, 2007. Proceedings / edited by Ian Miguel, Wheeler Ruml

Contributor(s): Resource type: Ressourcentyp: Buch (Online)Book (Online)Language: English Series: SpringerLink Bücher | Lecture notes in computer science ; 4612Publisher: Berlin ; Heidelberg : Springer, 2007Description: Online-Ressource (XI, 418 p, digital)ISBN:
  • 9783540735809
Subject(s): Genre/Form: Additional physical formats: 9783540735793 | Buchausg. u.d.T.: Abstraction, reformulation, and approximation. Berlin : Springer, 2007. XI, 418 S.DDC classification:
  • 006.3
  • 004
  • 004
RVK: RVK: ST 300LOC classification:
  • Q334-342 TJ210.2-211.495
  • QA75.7
DOI: DOI: 10.1007/978-3-540-73580-9Online resources: Summary: 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, and Thought -- 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.PPN: PPN: 1646885090Package identifier: Produktsigel: ZDB-2-LNC | ZDB-2-SCS | ZDB-2-SXCS | ZDB-2-SEB | ZDB-2-LNC
No physical items for this record
KIT – The University in the Helmholtz Association                         Home | Impressum | Datenschutz | Barrierefreiheit | KIT