4843 search results - page 226 / 969 » The Shortcut Problem - Complexity and Approximation |
134
Voted
ICCBR
2005
Springer
15 years 9 months ago
2005
Springer
CBR is one of the techniques that can be applied to the task of approximating a function over high-dimensional, continuous spaces. In Reinforcement Learning systems a learning agen...
151
Voted
HYBRID
2000
Springer
15 years 7 months ago
2000
Springer
In this paper we describe an experimental system called d=dt for approximating reachable states for hybrid systems whose continuous dynamics is de ned by linear di erential equatio...
103
Voted
UAI
2000
15 years 4 months ago
2000
Monitoring plan preconditions can allow for replanning when a precondition fails, generally far in advance of the point in the plan where the precondition is relevant. However, mo...
122
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
STSP seeks a pair of pickup and delivery tours in two distinct networks, where the two tours are related by LIFO contraints. We address here the problem approximability. We notabl...
113
Voted
IPL
2008
15 years 3 months ago
2008
The problem of biclustering consists of the simultaneous clustering of rows and columns of a matrix such that each of the submatrices induced by a pair of row and column clusters ...