1186 search results - page 19 / 238 » Improving Random Walk Performance |
AI
2005
Springer
13 years 10 months ago
2005
Springer
We present a new series of distributed constraint satisfaction algorithms, the distributed breakout algorithms, which is inspired by local search algorithms for solving the constr...
IJAHUC
2008
13 years 11 months 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...
LCN
2007
IEEE
14 years 5 months ago
2007
IEEE
Abstract—We study the performance of several search algorithms on unstructured peer-to-peer networks, both using classic search algorithms such as flooding and random walk, as w...
PAKM
2000
14 years 8 days ago
2000
This paper reports results of an empirical examination of the facilitating role of experimentation and socialisation in enhancing individual knowledge and performance in decision ...
105
click to vote
ECCV
2008
Springer
15 years 10 months ago
2008
Springer
We propose a new method for detecting objects such as bags carried by pedestrians depicted in short video sequences. In common with earlier work on the same problem, the method sta...