526 search results - page 3 / 106 » Efficient Algorithms for Online Decision Problems |
OR
2006
Springer
13 years 7 months ago
2006
Springer
The Dial-A-Ride Problem (DARP) has often been used to organize transport of elderly and handicapped people, assuming that these people can book their transport in advance. But the ...
ISAAC
1999
Springer
13 years 11 months ago
1999
Springer
We introduce an online relocation problem on a graph, in which a player who walks around the nodes makes decisions on whether to relocate mobile resources, while not knowing the fu...
ICIP
2009
IEEE
13 years 4 months ago
2009
IEEE
Decision trees have been widely used for online learning classification. Many approaches usually need large data stream to finish decision trees induction, as show notable limitat...
EWRL
2008
13 years 8 months ago
2008
Abstract. We consider a control problem where the decision maker interacts with a standard Markov decision process with the exception that the reward functions vary arbitrarily ove...
UAI
1998
13 years 8 months ago
1998
This paper presents two new approaches to decomposing and solving large Markov decision problems (MDPs), a partial decoupling method and a complete decoupling method. In these app...