1186 search results - page 36 / 238 » Improving Random Walk Performance |
ICALP
2004
Springer
14 years 4 months ago
2004
Springer
We study the random composition of a small family of O(n3 ) simple permutations on {0, 1}n . Specifically we ask what is the number of compositions needed to achieve a permutatio...
ANSS
2005
IEEE
14 years 4 months ago
2005
IEEE
The random trip model was recently proposed as a generic mobility model that contains many particular mobility models, including the widely-known random waypoint and random walks,...
KDD
2008
ACM
14 years 11 months ago
2008
ACM
We address the problem of classification in partially labeled networks (a.k.a. within-network classification) where observed class labels are sparse. Techniques for statistical re...
CEC
2008
IEEE
14 years 5 months ago
2008
IEEE
Abstract— This paper explores the idea of neutrality in heuristic optimization algorithms. In particular, the effect of having multiple levels of neutrality in representations is...
ICRA
2007
IEEE
14 years 5 months ago
2007
IEEE
— Coalescence is the problem of isolated mobile robots independently searching for peers with the goal of forming a single connected network. This is important because communicat...