3082 search results - page 99 / 617 » New Bounds for the Controller Problem |
139
Voted
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
120
click to vote
STOC
2005
ACM
15 years 9 months ago
2005
ACM
This paper focuses on competitive function evaluation in the context of computing with priced information. A function f is given together with a cost cx for each variable x of f. ...
111
click to vote
CIAC
2006
Springer
15 years 7 months ago
2006
Springer
We investigate the computational hardness of the Connectivity, the Strong Connectivity and the Broadcast type of Range Assignment Problems in R2 and R3. We present new reductions ...
134
click to vote
MP
2008
15 years 4 months ago
2008
This paper proposes an efficient computational technique for the optimal control of linear discrete-time systems subject to bounded disturbances with mixed polytopic constraints o...
151
click to vote
UAI
1998
15 years 5 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...