Lecture Notes in Computer Science - Abstraction, Reformulation and Approximation
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540278726, 9783540318828

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Learning Skills in Reinforcement Learning Using Relative Novelty

Lecture Notes in Computer Science - Abstraction, Reformulation and Approximation ◽

10.1007/11527862_36 ◽

2005 ◽

pp. 367-374 ◽

Cited By ~ 3

Author(s):

Özgür Şimşek ◽

Andrew G. Barto

Keyword(s):

Reinforcement Learning ◽

Learning Skills

Download Full-text

Feature-Discovering Approximate Value Iteration Methods

Lecture Notes in Computer Science - Abstraction, Reformulation and Approximation ◽

10.1007/11527862_25 ◽

2005 ◽

pp. 321-331 ◽

Cited By ~ 1

Author(s):

Jia-Hong Wu ◽

Robert Givan

Keyword(s):

Value Iteration ◽

Iteration Methods ◽

Approximate Value Iteration

Download Full-text

Learning Classifiers Using Hierarchically Structured Class Taxonomies

Lecture Notes in Computer Science - Abstraction, Reformulation and Approximation ◽

10.1007/11527862_24 ◽

2005 ◽

pp. 313-320 ◽

Cited By ~ 21

Author(s):

Feihong Wu ◽

Jun Zhang ◽

Vasant Honavar

Keyword(s):

Learning Classifiers

Download Full-text

Learning Abstract Scheduling Models

Lecture Notes in Computer Science - Abstraction, Reformulation and Approximation ◽

10.1007/11527862_30 ◽

2005 ◽

pp. 354-355

Author(s):

Tom Carchrae ◽

J. Christopher Beck

Keyword(s):

Scheduling Models

Download Full-text

Synthesizing Plans for Multiple Domains

Lecture Notes in Computer Science - Abstraction, Reformulation and Approximation ◽

10.1007/11527862_3 ◽

2005 ◽

pp. 30-43

Author(s):

Abdelbaki Bouguerra ◽

Lars Karlsson

Keyword(s):

Multiple Domains

Download Full-text

Designing Views to Efficiently Answer Real SQL Queries

Lecture Notes in Computer Science - Abstraction, Reformulation and Approximation ◽

10.1007/11527862_26 ◽

2005 ◽

pp. 332-346 ◽

Cited By ~ 1

Author(s):

Foto Afrati ◽

Rada Chirkova ◽

Manolis Gergatsoulis ◽

Vassia Pavlaki

Download Full-text

The Cruncher: Automatic Concept Formation Using Minimum Description Length

Lecture Notes in Computer Science - Abstraction, Reformulation and Approximation ◽

10.1007/11527862_21 ◽

2005 ◽

pp. 282-289 ◽

Cited By ~ 2

Author(s):

Marc Pickett ◽

Tim Oates

Keyword(s):

Concept Formation ◽

Minimum Description Length

Download Full-text

Function Approximation via Tile Coding: Automating Parameter Choice

Lecture Notes in Computer Science - Abstraction, Reformulation and Approximation ◽

10.1007/11527862_14 ◽

2005 ◽

pp. 194-205 ◽

Cited By ~ 20

Author(s):

Alexander A. Sherstov ◽

Peter Stone

Keyword(s):

Function Approximation ◽

Parameter Choice ◽

Tile Coding

Download Full-text

A Specialised Binary Constraint for the Stable Marriage Problem

Lecture Notes in Computer Science - Abstraction, Reformulation and Approximation ◽

10.1007/11527862_16 ◽

2005 ◽

pp. 218-233 ◽

Cited By ~ 5

Author(s):

Chris Unsworth ◽

Patrick Prosser

Keyword(s):

Stable Marriage ◽

Stable Marriage Problem ◽

Marriage Problem ◽

The Stable Marriage Problem ◽

Binary Constraint

Download Full-text

Model-Based Search

Lecture Notes in Computer Science - Abstraction, Reformulation and Approximation ◽

10.1007/11527862_35 ◽

2005 ◽

pp. 365-366

Author(s):

Wheeler Ruml

Keyword(s):

Model Based

Download Full-text

Lecture Notes in Computer Science - Abstraction, Reformulation and ApproximationLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Learning Skills in Reinforcement Learning Using Relative Novelty

Feature-Discovering Approximate Value Iteration Methods

Learning Classifiers Using Hierarchically Structured Class Taxonomies

Learning Abstract Scheduling Models

Synthesizing Plans for Multiple Domains

Designing Views to Efficiently Answer Real SQL Queries

The Cruncher: Automatic Concept Formation Using Minimum Description Length

Function Approximation via Tile Coding: Automating Parameter Choice

A Specialised Binary Constraint for the Stable Marriage Problem

Model-Based Search

Lecture Notes in Computer Science - Abstraction, Reformulation and Approximation
Latest Publications