4860 search results - page 413 / 972 » SNPs Problems, Complexity, and Algorithms |
128
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
123
click to vote
ESA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Most recent papers addressing the algorithmic problem of allocating advertisement space for keywords in sponsored search auctions assume that pricing is done via a first...
182
click to vote
STACS
2012
Springer
13 years 11 months ago
2012
Springer
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...
188
click to vote
MOBIHOC
2012
ACM
13 years 6 months ago
2012
ACM
We propose a routing scheme to implement multicast communication in wireless networks. The scheme is oblivious, compact, and completely decentralized. It is intended to support dy...
114
click to vote
MOBICOM
2006
ACM
15 years 9 months ago
2006
ACM
Determining node positions is essential for many next-generation network functionalities. Previous localization algorithms lack correctness guarantees or require network density h...