860 search results - page 65 / 172 » Biased Random Walks |
126
Voted
CORR
2010
Springer
14 years 7 months ago
2010
Springer
This paper extends the analogies employed in the development of quantum-inspired evolutionary algorithms by proposing quantum-inspired Hadamard walks, called QHW. A novel quantum-...
125
Voted
IJAHUC
2008
15 years 21 days ago
2008
: Random walk and flooding are basic mechanisms for searching unstructured overlays. This paper shows that node coverage is an important metric for query performance in random grap...
STACS
2009
Springer
15 years 7 months ago
2009
Springer
As the World Wide Web is growing rapidly, it is getting increasingly challenging to gather representative information about it. Instead of crawling the web exhaustively one has to...
96
Voted
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
This paper investigates the ability of a tournament selection based genetic algorithm to find mutationally robust solutions to a simple combinatorial optimization problem. Two di...
117
Voted
DIALM
2008
ACM
15 years 2 months ago
2008
ACM
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...