Normal view MARC view ISBD view

Abstraction, Reformulation and Approximation [electronic resource] : 6th International Symposium, SARA 2005, Airth Castle, Scotland, UK, July 26-29, 2005, Proceedings / edited by Jean-Daniel Zucker, Lorenza Saitta.

Contributor(s): Zucker, Jean-Daniel [editor.] | Saitta, Lorenza [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Lecture Notes in Artificial Intelligence: 3607Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2005Edition: 1st ed. 2005.Description: XII, 380 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540318828.Subject(s): Computer science | Artificial intelligence | Machine theory | Theory of Computation | Artificial Intelligence | Computer Science Logic and Foundations of Programming | Formal Languages and Automata TheoryAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 004.0151 Online resources: Click here to access online
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.
In: Springer Nature eBook
    average rating: 0.0 (0 votes)
No physical items for this record

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.

There are no comments for this item.

Log in to your account to post a comment.