2477 search results - page 273 / 496 » Approximate extended formulations |
122
Voted
AIPS
2004
15 years 6 months ago
2004
We present new results on the problem of finding an enclosing rectangle of minimum area that will contain a given a set of rectangles. Many simple scheduling tasks can be modelled...
152
click to vote
NIPS
2004
15 years 6 months ago
2004
Schema learning is a way to discover probabilistic, constructivist, predictive action models (schemas) from experience. It includes methods for finding and using hidden state to m...
133
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
XCS with computed prediction, namely XCSF, has been recently extended in several ways. In particular, a novel prediction update algorithm based on recursive least squares and the ...
117
click to vote
DKE
2008
15 years 4 months ago
2008
As two classical measures, approximation accuracy and consistency degree can be extended for evaluating the decision performance of an incomplete decision table. However, when the...
165
click to vote
JAIR
2008
15 years 4 months ago
2008
Probabilistic planning problems are typically modeled as a Markov Decision Process (MDP). MDPs, while an otherwise expressive model, allow only for sequential, non-durative action...