3422 search results - page 69 / 685 » Random Subset Optimization |
112
Voted
CORR
2007
Springer
15 years 2 months ago
2007
Springer
THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD. We consider distributed computation of functions of distributed data in random planar networks with noisy wireless links. We pre...
123
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
Finding the largest independent set in a graph is a notoriously difficult NP-complete combinatorial optimization problem. Moreover, even for graphs with largest degree 3, no polyn...
143
click to vote
COLOGNETWENTE
2010
15 years 29 days ago
2010
We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is flipp...
117
click to vote
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
119
click to vote
INFOCOM
2010
IEEE
15 years 25 days ago
2010
IEEE
—This paper formally establishes that random access scheduling schemes, and, more specifically CSMA-CA, yields exceptionally good performance in the context of wireless multihop...