4860 search results - page 282 / 972 » SNPs Problems, Complexity, and Algorithms |
101
Voted
STOC
2004
ACM
16 years 1 months ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
109
Voted
PODC
2009
ACM
15 years 7 months ago
2009
ACM
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
93
Voted
CORR
2010
Springer
14 years 7 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
104
click to vote
APPROX
2008
Springer
15 years 2 months ago
2008
Springer
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
129
click to vote
ESAW
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Load-Balancing is a significant problem in heterogeneous distributed systems. There exist many load balancing algorithms, however, most approaches are very problem speci...