952 search results - page 147 / 191 » Computational complexity of stochastic programming problems |
106
Voted
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
113
Voted
SPAA
2003
ACM
15 years 7 months ago
2003
ACM
The increasing application space of interconnection networks now encompasses several applications, such as packet routing and I/O interconnect, where the throughput of a routing a...
115
Voted
DCC
2004
IEEE
16 years 2 months ago
2004
IEEE
We introduce three new innovations for compression using LDPCs for the Slepian-Wolf problem. The first is a general iterative Slepian-Wolf decoding algorithm that incorporates the...
145
Voted
CONEXT
2005
ACM
15 years 4 months ago
2005
ACM
Network measurement is essential for assessing performance issues, identifying and locating problems. Two common strategies are the passive approach that attaches specific device...
135
click to vote
ACMSE
2010
ACM
14 years 9 months ago
2010
ACM
The ranking problem appears in many areas of study such as customer rating, social science, economics, and information retrieval. Ranking can be formulated as a classification pro...