352 search results - page 49 / 71 » On the optimal reachability problem of weighted timed automa... |
168
click to vote
ESA
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
168
click to vote
SIGECOM
2009
ACM
16 years 18 days ago
2009
ACM
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
156
click to vote
ICRA
2008
IEEE
16 years 16 days ago
2008
IEEE
— Target tracking has two variants that are often studied independently with different approaches: target searching requires a robot to find a target initially not visible, and ...
169
click to vote
NIPS
2007
15 years 7 months ago
2007
Planning in partially observable environments remains a challenging problem, despite significant recent advances in offline approximation techniques. A few online methods have a...
186
click to vote
ICDCS
2010
IEEE
15 years 10 months ago
2010
IEEE
—We propose a steepest descent method to compute optimal control parameters for balancing between multiple performance objectives in stateless stochastic scheduling, wherein the ...