1547 search results - page 113 / 310 » Solving Knapsack Problems in a Sticker Based Model |
169
click to vote
EOR
2006
15 years 6 months ago
2006
: This paper addresses the problem of computing minimum risk paths by taking as objective the expected accident cost. The computation is based on a dynamic programming formulation ...
172
click to vote
INFOCOM
2005
IEEE
15 years 12 months ago
2005
IEEE
— We consider the problem of scheduling multiple users sharing a time-varying wireless channel. (As an example, this is a model of scheduling in 3G wireless technologies, such as...
156
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
This paper studies the problem of multibody motion segmentation, which is an important, but challenging problem due to its well-known chicken-and-egg-type recursive character. We ...
152
click to vote
HYBRID
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We consider the problem of security constrained optimal control for discrete-time, linear dynamical systems in which control and measurement packets are transmitted over ...
148
click to vote
IPPS
2003
IEEE
15 years 11 months ago
2003
IEEE
In this paper we develop a methodology for treating the problem of scheduling partially-ordered tasks on parallel machines. Our framework is based on the timed automaton model, or...