Sciweavers

2571 search results - page 486 / 515
» Approximation schemes for wireless networks
Sort
View
LATIN
2004
Springer
15 years 7 months ago
Global Synchronization in Sensornets
Time synchronization is necessary in many distributed systems, but achieving synchronization in sensornets, which combine stringent precision requirements with severe resource con...
Jeremy Elson, Richard M. Karp, Christos H. Papadim...
CORR
2008
Springer
88views Education» more  CORR 2008»
15 years 2 months ago
Lower bounds for distributed markov chain problems
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
Rahul Sami, Andy Twigg
GECCO
2006
Springer
195views Optimization» more  GECCO 2006»
15 years 5 months ago
Studying XCS/BOA learning in Boolean functions: structure encoding and random Boolean functions
Recently, studies with the XCS classifier system on Boolean functions have shown that in certain types of functions simple crossover operators can lead to disruption and, conseque...
Martin V. Butz, Martin Pelikan
COMPGEOM
2004
ACM
15 years 7 months ago
Low-dimensional embedding with extra information
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Haji...
JUCS
2008
120views more  JUCS 2008»
15 years 1 months ago
Guaranteeing Seamless Mobility with User Redials and Automatic Handover Retrials
: In communication systems that guarantee seamless mobility of users across service areas, repeated attempts occur as a result of user behavior but also as automatic retries of blo...
José Manuel Giménez-Guzmán, M...