000 04931nam a22003855i 4500
001 295407
003 MX-SnUAN
005 20170705134233.0
007 cr nn 008mamaa
008 150903s2005 gw | o |||| 0|eng d
020 _a9783540318828
_99783540318828
024 7 _a10.1007/11527862
_2doi
035 _avtls000348011
039 9 _a201509030753
_bVLOAD
_c201404121021
_dVLOAD
_c201404090759
_dVLOAD
_y201402071017
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
050 4 _aQ334-342
100 1 _aZucker, Jean-Daniel.
_eeditor.
_9320780
245 1 0 _aAbstraction, Reformulation and Approximation :
_b6th International Symposium, SARA 2005, Airth Castle, Scotland, UK, July 26-29, 2005. Proceedings /
_cedited by Jean-Daniel Zucker, Lorenza Saitta.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2005.
300 _axii, 376 páginas Also available online.
_brecurso en línea.
336 _atexto
_btxt
_2rdacontent
337 _acomputadora
_bc
_2rdamedia
338 _arecurso en línea
_bcr
_2rdacarrier
347 _aarchivo de texto
_bPDF
_2rda
490 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v3607
500 _aSpringer eBooks
505 0 _aFull 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.
520 _aThis book constitutes the refereed proceedings of the 6th International Symposium on Abstraction, Reformulation, and Approximation, SARA 2005, held in Airth Castle, Scotland, UK in July 2005. The 17 revised full papers and 8 extended abstracts were carefully reviewed and selected for inclusion in the book. Also included are 3 invited papers and 8 research summaries. All current aspects of abstraction, reformulation, and approximation in the context of human common-sense reasoning, problem solving, and efficiently reasoning in complex domains are addressed. Among the application fields of these techniques are automatic programming, constraint satisfaction, design, diagnosis, machine learning, search, planning, reasoning, game playing, scheduling, and theorem proving.
590 _aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700 1 _aSaitta, Lorenza.
_eeditor.
_9320779
710 2 _aSpringerLink (Servicio en línea)
_9299170
776 0 8 _iEdición impresa:
_z9783540278726
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/11527862
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c295407
_d295407