Cargando…

Abstraction, Reformulation and Approximation 6th International Symposium, SARA 2005, Airth Castle, Scotland, UK, July 26-29, 2005, Proceedings /

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Zucker, Jean-Daniel (Editor ), Saitta, Lorenza (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2005.
Edición:1st ed. 2005.
Colección:Lecture Notes in Artificial Intelligence, 3607
Temas:
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-3-540-31882-8
003 DE-He213
005 20221012193527.0
007 cr nn 008mamaa
008 100720s2005 gw | s |||| 0|eng d
020 |a 9783540318828  |9 978-3-540-31882-8 
024 7 |a 10.1007/11527862  |2 doi 
050 4 |a QA75.5-76.95 
072 7 |a UYA  |2 bicssc 
072 7 |a COM014000  |2 bisacsh 
072 7 |a UYA  |2 thema 
082 0 4 |a 004.0151  |2 23 
245 1 0 |a Abstraction, Reformulation and Approximation  |h [electronic resource] :  |b 6th International Symposium, SARA 2005, Airth Castle, Scotland, UK, July 26-29, 2005, Proceedings /  |c edited by Jean-Daniel Zucker, Lorenza Saitta. 
250 |a 1st ed. 2005. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2005. 
300 |a XII, 380 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Artificial Intelligence,  |x 2945-9141 ;  |v 3607 
505 0 |a 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. 
650 0 |a Computer science. 
650 0 |a Artificial intelligence. 
650 0 |a Machine theory. 
650 1 4 |a Theory of Computation. 
650 2 4 |a Artificial Intelligence. 
650 2 4 |a Computer Science Logic and Foundations of Programming. 
650 2 4 |a Formal Languages and Automata Theory. 
700 1 |a Zucker, Jean-Daniel.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Saitta, Lorenza.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783540813286 
776 0 8 |i Printed edition:  |z 9783540278726 
830 0 |a Lecture Notes in Artificial Intelligence,  |x 2945-9141 ;  |v 3607 
856 4 0 |u https://doi.uam.elogim.com/10.1007/11527862  |z Texto Completo 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710)