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

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Zucker, Jean-Daniel (Επιμελητής έκδοσης), Saitta, Lorenza (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2005.
Σειρά:Lecture Notes in Computer Science, 3607
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 04424nam a22005415i 4500
001 978-3-540-31882-8
003 DE-He213
005 20151204190502.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 
040 |d GrThAP 
050 4 |a QA75.5-76.95 
072 7 |a UY  |2 bicssc 
072 7 |a UYA  |2 bicssc 
072 7 |a COM014000  |2 bisacsh 
072 7 |a COM031000  |2 bisacsh 
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. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |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 Computer Science,  |x 0302-9743 ;  |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 Computers. 
650 0 |a Computer logic. 
650 0 |a Mathematical logic. 
650 0 |a Artificial intelligence. 
650 1 4 |a Computer Science. 
650 2 4 |a Theory of Computation. 
650 2 4 |a Artificial Intelligence (incl. Robotics). 
650 2 4 |a Logics and Meanings of Programs. 
650 2 4 |a Mathematical Logic and Formal Languages. 
700 1 |a Zucker, Jean-Daniel.  |e editor. 
700 1 |a Saitta, Lorenza.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783540278726 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 3607 
856 4 0 |u http://dx.doi.org/10.1007/11527862  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)