7006 search results - page 420 / 1402 » Approximation Algorithms |
180
click to vote
IPL
2010
14 years 11 months ago
2010
This paper deals with broadcasting in a network with t-locally bounded Byzantine faults. One of the simplest broadcasting algorithms under Byzantine failures is referred to as a c...
129
Voted
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
We propose blind equalization algorithms that perform similarly to supervised ones, independently of the QAM order. They converge approximately to the Wiener solution, which gener...
150
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
142
click to vote
SIGECOM
2009
ACM
15 years 11 months ago
2009
ACM
We study online pricing problems in markets with cancellations, i.e., markets in which prior allocation decisions can be revoked, but at a cost. In our model, a seller receives re...
162
Voted
IRREGULAR
1995
Springer
15 years 8 months ago
1995
Springer
In this paper, we review parallel search techniques for approximating the global optimal solution of combinatorial optimization problems. Recent developments on parallel implementa...