Abstraction, Reformulation and Approximation
Editat de Jean-Daniel Zucker, Lorenza Saittaen Limba Engleză Paperback – 14 iul 2005
Preț: 326.88 lei
Preț vechi: 408.60 lei
-20%
Puncte Express: 490
Carte tipărită la comandă
Livrare economică 08-22 iulie
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540278726
ISBN-10: 3540278729
Pagini: 392
Ilustrații: XII, 380 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.59 kg
Ediția:2005
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540278729
Pagini: 392
Ilustrații: XII, 380 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.59 kg
Ediția:2005
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Full Papers.- Verifying the Incorrectness of Programs and Automata.- Generating Admissible Heuristics by Abstraction for Search in Stochastic Domains.- Synthesizing Plans for Multiple Domains.- Abstract Policy Evaluation for Reactive Agents.- Implementing an Abstraction Framework for Soft Constraints.- Transforming and Refining Abstract Constraint Specifications.- Learning Regular Expressions from Noisy Sequences.- From Factorial and Hierarchical HMM to Bayesian Network: A Representation Change Algorithm.- Hierarchical Heuristic Search Revisited.- Multinomial Event Model Based Abstraction for Sequence and Text Classification.- Petri Net Reachability Checking Is Polynomial with Optimal Abstraction Hierarchies.- Detecting and Breaking Symmetries by Reasoning on Problem Specifications.- Approximate Model-Based Diagnosis Using Preference-Based Compilation.- Function Approximation via Tile Coding: Automating Parameter Choice.- Creating Better Abstract Operators.- A Specialised Binary Constraint for the Stable Marriage Problem.- Compositional Derivation of Symmetries for Constraint Satisfaction.- Extended Abstracts.- Solving the 24 Puzzle with Instance Dependent Pattern Databases.- Combining Feature Selection and Feature Construction to Improve Concept Learning for High Dimensional Data.- A Qualitative Spatio-temporal Abstraction of a Disaster Space.- The Cruncher: Automatic Concept Formation Using Minimum Description Length.- Experiments with Multiple Abstraction Heuristics in Symbolic Verification.- Probabilistic Abstraction of Uncertain Temporal Data for Multiple Subjects.- Learning Classifiers Using Hierarchically Structured Class Taxonomies.- Feature-Discovering Approximate Value Iteration Methods.- Invited Talks.- Designing Views to Efficiently Answer Real SQL Queries.-The Multi-depot Periodic Vehicle Routing Problem.- Abstract Representation in Painting and Computing.- Research Summaries.- Categorizing Gene Expression Correlations with Bioclinical Data: An Abstraction Based Approach.- Learning Abstract Scheduling Models.- Knowledge Acquisition on Manipulation of Flow and Water Quality Models.- Abstraction and Multiple Abstraction in the Symbolic Modeling of the Environment of Mobile Robots.- Sequential Decision Making Under Uncertainty.- Automatic State Abstraction for Pathfinding in Real-Time Video Games.- Model-Based Search.- Learning Skills in Reinforcement Learning Using Relative Novelty.