4843 search results - page 423 / 969 » The Shortcut Problem - Complexity and Approximation |
172
click to vote
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...
152
click to vote
ESA
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...
162
click to vote
HYBRID
2009
Springer
15 years 11 months ago
2009
Springer
We investigate a new approach for solving boundary control problems for dynamical systems that are governed by transport equations, when the control function is restricted to binar...
141
click to vote
ICC
2007
IEEE
15 years 11 months ago
2007
IEEE
— In this paper, we investigate the problem of grouping the sensor nodes into clusters to enhance the overall scalability of the network. A selected set of nodes, known as gatewa...
152
click to vote
HYBRID
2007
Springer
15 years 11 months ago
2007
Springer
This work investigates some of the computational issues involved in the solution of probabilistic reachability problems for discretetime, controlled stochastic hybrid systems. It i...