3049 search results - page 331 / 610 » On the Convergence of Bound Optimization Algorithms |
171
click to vote
PODC
2000
ACM
15 years 10 months ago
2000
ACM
We present an approach for merging message streams from producers distributed over a network, using a deterministic algorithm that is independent of any nondeterminism of the syst...
164
click to vote
EVOW
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. Motivated by parallel optimization, we study the SelfAdaptation algorithm for large population sizes. We first show that the current version of this algorithm does not r...
171
click to vote
IPL
2008
15 years 6 months ago
2008
Max-SAT-CC is the following optimization problem: Given a formula in CNF and a bound k, find an assignment with at most k variables being set to true that maximizes the number of ...
160
Voted
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. In this paper, we examine the problem of choosing discriminatory prices for customers with probabilistic valuations and a seller with indistinguishable copies of a good. ...
157
click to vote
ICDCS
1995
IEEE
15 years 10 months ago
1995
IEEE
Protocols that provide reliable communicationon top of a network that can lose packets rely on periodically retransmitting packets. The choice of retransmission timeout critically...