100 search results - page 2 / 20 » New complexity results for time-constrained dynamical optima... |
ESA
2005
Springer
13 years 11 months ago
2005
Springer
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
ATAL
2010
Springer
13 years 7 months ago
2010
Springer
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
KR
2004
Springer
13 years 11 months ago
2004
Springer
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
COMCOM
2006
13 years 6 months ago
2006
Managing the bandwidth allocated to a Label Switched Path in MPLS networks plays a major role for provisioning of Quality of Service and efficient use of resources. In doing so, t...
JMLR
2010
13 years 1 months ago
2010
With the goal to generate more scalable algorithms with higher efficiency and fewer open parameters, reinforcement learning (RL) has recently moved towards combining classical tec...