1 option
Abstraction, Reformulation and Approximation : 6th International Symposium, SARA 2005, Airth Castle, Scotland, UK, July 26-29, 2005, Proceedings / edited by Jean-Daniel Zucker, Lorenza Saitta.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science. Lecture notes in artificial intelligence ; 3607.
- Lecture Notes in Artificial Intelligence ; 3607
- Language:
- English
- Subjects (All):
- Computers.
- Artificial intelligence.
- Computer logic.
- Logic, Symbolic and mathematical.
- Theory of Computation.
- Artificial Intelligence.
- Logics and Meanings of Programs.
- Mathematical Logic and Formal Languages.
- Local Subjects:
- Theory of Computation.
- Artificial Intelligence.
- Logics and Meanings of Programs.
- Mathematical Logic and Formal Languages.
- Physical Description:
- 1 online resource (XII, 380 pages).
- Edition:
- First edition 2005.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2005.
- System Details:
- text file PDF
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-31882-8
- 9783540318828
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.