5316 search results - page 31 / 1064 » Which Search Problems Are Random |
ATAL
2009
Springer
15 years 1 months ago
2009
Springer
Motion planning for mobile agents, such as robots, acting in the physical world is a challenging task, which traditionally concerns safe obstacle avoidance. We are interested in p...
97
Voted
INFOCOM
2005
IEEE
15 years 6 months ago
2005
IEEE
— We study hybrid search schemes for unstructured peer-to-peer networks. We quantify performance in terms of number of hits, network overhead, and response time. Our schemes comb...
124
click to vote
SIGIR
2011
ACM
14 years 3 months ago
2011
ACM
Online forum discussions are emerging as valuable information repository, where knowledge is accumulated by the interaction among users, leading to multiple threads with structure...
136
click to vote
ICPP
2005
IEEE
15 years 6 months ago
2005
IEEE
Consider a heterogeneous cluster system, consisting of processors with varying processing capabilities and network links with varying bandwidths. Given a DAG application to be sch...
96
Voted
ARCS
2004
Springer
15 years 6 months ago
2004
Springer
Searching in decentralized peer-to-peer networks is a challenging problem. In common applications such as Gnutella, searching is performed by randomly forwarding queries to all pee...