1080 search results - page 160 / 216 » Problem dependent optimization (PDO) |
132
click to vote
GLOBECOM
2008
IEEE
15 years 10 months ago
2008
IEEE
—In this paper, we address the problem of establishing full connectivity and satisfying required traffic capacity between disconnected clusters in large wireless ad-hoc ground n...
125
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
104
click to vote
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
In context-aware route planning, a set of agents has to plan routes on a common infrastructure and each agent has to plan a conflict-free route from a source to a destination wit...
126
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...
125
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
The success of tensor-based subspace learning depends heavily on reducing correlations along the column vectors of the mode-k flattened matrix. In this work, we study the problem ...