1542 search results - page 107 / 309 » The Observational Power of Clocks |
205
click to vote
MSWIM
2006
ACM
16 years 12 days ago
2006
ACM
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
180
click to vote
CEC
2008
IEEE
15 years 8 months ago
2008
IEEE
We present a simple framework for dealing with search spaces consisting of permutations. To demonstrate its usefulness, we build upon it a simple (1 + 1)-evolutionary algorithm fo...
182
click to vote
ALENEX
2003
15 years 7 months ago
2003
Graph models for real-world complex networks such as the Internet, the WWW and biological networks are necessary for analytic and simulation-based studies of network protocols, al...
188
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
A polynomial identity testing algorithm must determine whether an input polynomial (given for instance by an arithmetic circuit) is identically equal to 0. In this paper, we show ...
156
click to vote
TOSN
2011
15 years 1 months ago
2011
A stochastic model is formulated and analyzed to study the advancements of messages under greedy routing in a sensor network with a power-saving scheme. The aim of this model is g...