502 search results - page 77 / 101 » Monotone Approximation of Decision Problems |
NIPS
2007
15 years 1 months ago
2007
In many applications, one has to actively select among a set of expensive observations before making an informed decision. Often, we want to select observations which perform well...
101
click to vote
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
—This is by far the first paper considering joint optimization of link scheduling, routing and replication for disruption-tolerant networks (DTNs). The optimization problems for...
104
click to vote
CP
2009
Springer
15 years 6 months ago
2009
Springer
The problem of finding a collection of solutions to a combinatorial problem that is optimal in terms of an inter-solution objective function exists in many application settings. F...
108
click to vote
ICTAI
2009
IEEE
14 years 9 months ago
2009
IEEE
We introduce TiMDPpoly, an algorithm designed to solve planning problems with durative actions, under probabilistic uncertainty, in a non-stationary, continuous-time context. Miss...
100
click to vote
AIPS
2008
15 years 2 months ago
2008
In the planning-as-SAT paradigm there have been numerous recent developments towards improving the speed and scalability of planning at the cost of finding a step-optimal parallel...