17760 search results - page 119 / 3552 » A Generalization of the Massey-Ding Algorithm |
126
click to vote
COMPGEOM
2007
ACM
15 years 7 months ago
2007
ACM
We prove an optimal generalization of the centerpoint theorem: given a set P of n points in the plane, there exist two points (not necessarily among input points) that hit all con...
123
Voted
ATAL
2006
Springer
15 years 7 months ago
2006
Springer
This paper proposes a general solution model using agent technology in order to solve two critical open issues in the course timetabling problem: application-specific issues and d...
121
Voted
UAI
2003
15 years 5 months ago
2003
Symbolic representations have been used successfully in off-line planning algorithms for Markov decision processes. We show that they can also improve the performance of online p...
126
Voted
ATAL
2010
Springer
15 years 4 months ago
2010
Springer
We present a new approach for finding generalized contingent plans with loops and branches in situations where there is uncertainty in state properties and object quantities, but ...
135
click to vote
APIN
2004
15 years 3 months ago
2004
In this paper we are concerned with the problem of learning how to solve planning problems in one domain given a number of solved instances. This problem is formulated as the probl...