Sciweavers

72 search results - page 4 / 15
» Learning Heuristic Functions through Approximate Linear Prog...
Sort
View
ICTAI
2010
IEEE
13 years 4 months ago
Continuous Search in Constraint Programming
This work presents the concept of Continuous Search (CS), which objective is to allow any user to eventually get their constraint solver achieving a top performance on their proble...
Alejandro Arbelaez, Youssef Hamadi, Michèle...
TEC
2008
115views more  TEC 2008»
13 years 6 months ago
Function Approximation With XCS: Hyperellipsoidal Conditions, Recursive Least Squares, and Compaction
An important strength of learning classifier systems (LCSs) lies in the combination of genetic optimization techniques with gradient-based approximation techniques. The chosen app...
Martin V. Butz, Pier Luca Lanzi, Stewart W. Wilson
AUTOMATICA
1999
145views more  AUTOMATICA 1999»
13 years 6 months ago
Control of systems integrating logic, dynamics, and constraints
This paper proposes a framework for modeling and controlling systems described by interdependent physical laws, logic rules, and operating constraints, denoted as mixed logical dy...
Alberto Bemporad, Manfred Morari
IJCAI
1989
13 years 8 months ago
Learning Novel Domains Through Curiosity and Conjecture
This paper describes DIDO, a system we have developed to carry out exploratory learning of unfamiliar domains without assistance from an external teacher. The program incorporates...
Paul D. Scott, Shaul Markovitch
CORR
2010
Springer
119views Education» more  CORR 2010»
13 years 7 months ago
Dynamic Policy Programming
In this paper, we consider the problem of planning and learning in the infinite-horizon discounted-reward Markov decision problems. We propose a novel iterative direct policysearc...
Mohammad Gheshlaghi Azar, Hilbert J. Kappen