1041 search results - page 76 / 209 » Randomizing Reductions of Search Problems |
WIOPT
2005
IEEE
14 years 1 months ago
2005
IEEE
In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large wireless network. We consider the class of controlled flo...
CCS
2010
ACM
13 years 8 months ago
2010
ACM
The ability to locate random relays is a key challenge for peer-to-peer (P2P) anonymous communication systems. Earlier attempts like Salsa and AP3 used distributed hash table look...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
—Cooperative jamming (CJ) schemes support secure wireless communication in the presence of one or more eavesdroppers. Larger numbers of cooperative relays provide better secrecy ...
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
We introduce an adversarial planning algorithm based on game tree search, which is applicable in large-scale multiplayer domains. In order to tackle the scalability issues of game...