801 search results - page 67 / 161 » Minimal Locked Trees |
155
click to vote
EOR
2008
15 years 6 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. ...
181
click to vote
NETWORKS
2010
15 years 4 months ago
2010
We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having it...
153
click to vote
MDM
2009
Springer
16 years 27 days ago
2009
Springer
Continuous queries in Wireless Sensor Networks (WSNs) are founded on the premise of Query Routing Tree structures (denoted as T), which provide sensors with a path to the querying...
209
click to vote
ICASSP
2008
IEEE
16 years 24 days ago
2008
IEEE
Compressive sensing aims to recover a sparse or compressible signal from a small set of projections onto random vectors; conventional solutions involve linear programming or greed...
171
click to vote
ICC
2008
IEEE
16 years 24 days ago
2008
IEEE
—Connectivity-based routing protocols use the hop count vector to a group of anchors for packet forwarding. Due to the discrete nature of hop count based coordinates, without an ...