982 search results - page 85 / 197 » Solving Steiner tree problems in graphs to optimality |
EOR
2008
14 years 10 months ago
2008
The aim of this paper is to apply the concept of robust optimization introduced by Bel-Tal and Nemirovski to the portfolio selection problems based on multi-stage scenario trees. ...
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
—The demand for efficient data dissemination/access techniques to find the relevant data from within a sensor network has led to the development of data-centric sensor networks...
ICRA
2002
IEEE
15 years 3 months ago
2002
IEEE
Trajectory design for high-dimensional systems with nonconvex constraints is a challenging problem considered in this paper. Classical dynamic programming is often employed, but c...
IPPS
1997
IEEE
15 years 2 months ago
1997
IEEE
The n-dimensional grid is one of the most representative patterns of data flow in parallel computation. The most frequently used scheduling models for grids is the unit execution ...
CASES
2009
ACM
15 years 4 months ago
2009
ACM
This paper solves the open problem of extracting the maximal number of iterations from a loop that can be executed in parallel on chip multiprocessors. Our algorithm solves it opt...