Sciweavers

4860 search results - page 502 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
MOBIHOC
2006
ACM
16 years 3 months ago
MLS: : an efficient location service for mobile ad hoc networks
MLS is a distributed location service to track the position of mobile nodes and to route messages between any two nodes. The lookup of nodes is achieved by searching in a hierarch...
Roland Flury, Roger Wattenhofer
INFOCOM
2006
IEEE
15 years 10 months ago
Efficient Flooding Scheme Based on 1-Hop Information in Mobile Ad Hoc Networks
—Flooding is one of the most fundamental operations in mobile ad hoc networks. Traditional implementation of flooding suffers from the problems of excessive redundancy of message...
Hai Liu, Peng-Jun Wan, Xiaohua Jia, Xinxin Liu, F....
GECCO
2005
Springer
228views Optimization» more  GECCO 2005»
15 years 9 months ago
Applying metaheuristic techniques to search the space of bidding strategies in combinatorial auctions
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...
Ashish Sureka, Peter R. Wurman
COMPGEOM
2004
ACM
15 years 9 months ago
An empirical comparison of techniques for updating Delaunay triangulations
The computation of Delaunay triangulations from static point sets has been extensively studied in computational geometry. When the points move with known trajectories, kinetic dat...
Leonidas J. Guibas, Daniel Russel
FOCS
2003
IEEE
15 years 9 months ago
List-Decoding Using The XOR Lemma
We show that Yao’s XOR Lemma, and its essentially equivalent rephrasing as a Direct Product Lemma, can be re-interpreted as a way of obtaining error-correcting codes with good l...
Luca Trevisan