Abstraction, Reformulation, and Approximation
Editat de Sven Koenig, Robert C. Holteen Limba Engleză Paperback – 19 iul 2002
Preț: 324.63 lei
Preț vechi: 405.79 lei
-20%
Puncte Express: 487
Preț estimativ în valută:
57.45€ • 67.14$ • 49.88£
57.45€ • 67.14$ • 49.88£
Carte tipărită la comandă
Livrare economică 20 februarie-06 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540439417
ISBN-10: 3540439412
Pagini: 368
Ilustrații: XI, 352 p.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.56 kg
Ediția:2002
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540439412
Pagini: 368
Ilustrații: XI, 352 p.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.56 kg
Ediția:2002
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited Presentations.- Model Checking and Abstraction.- Reformulation in Planning.- Spatiotemporal Abstraction of Stochastic Sequential Processes.- State Space Relaxation and Search Strategies in Dynamic Programming.- Invited Presentations.- Admissible Moves in Two-Player Games.- Dynamic Bundling: Less Effort for More Solutions.- Symbolic Heuristic Search Using Decision Diagrams.- On the Construction of Human-Automation Interfaces by Formal Abstraction.- Pareto Optimization of Temporal Decisions.- An Information-Theoretic Characterization of Abstraction in Diagnosis and Hypothesis Selection.- A Tractable Query Cache by Approximation.- An Algebraic Framework for Abstract Model Checking.- Action Timing Discretization with Iterative-Refinement.- Formalizing Approximate Objects and Theories: Some Initial Results.- Model Minimization in Hierarchical Reinforcement Learning.- Learning Options in Reinforcement Learning.- Approximation Techniques for Non-linear Problems with Continuum of Solutions.- Approximation of Relations by Propositional Formulas: Complexity and Semantics.- Abstracting Visual Percepts to Learn Concepts.- Short Presentations.- PAC Meditation on Boolean Formulas.- On the Reformulation of Vehicle Routing Problems and Scheduling Problems.- The Oracular Constraints Method.- Performance of Lookahead Control Policies in the Face of Abstractions and Approximations.- TTree: Tree-Based State Generalization with Temporally Abstract Actions.- Ontology-Driven Induction of Decision Trees at Multiple Levels of Abstraction.- Research Summaries.- Abstracting Imperfect Information Game Trees.- Using Abstraction for Heuristic Search and Planning.- Approximation Techniques in Multiagent Learning.- Abstraction and Reformulation in GraphPlan.- Abstract Reasoning for Planning and Coordination.- Research Summary: Abstraction Techniques, and Their Value.- Reformulation of Non-binary Constraints.- Reformulating Combinatorial Optimization as Constraint Satisfaction.- Autonomous Discovery of Abstractions through Interaction with an Environment.- Interface Verification: Discrete Abstractions of Hybrid Systems.- Learning Semi-lattice Codebooks for Image Compression.- Research Summary.- Principled Exploitation of Heuristic Information.- Reformulation of Temporal Constraint Networks.
Caracteristici
Includes supplementary material: sn.pub/extras