5316 search results - page 893 / 1064 » Which Search Problems Are Random |
160
click to vote
TCC
2009
Springer
16 years 5 months ago
2009
Springer
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...
155
click to vote
PERCOM
2009
ACM
16 years 5 months ago
2009
ACM
In this paper, a DHT-based routing protocol which integrates at the network layer both traditional direct routing, i.e. MANET routing, and indirect key-based routing, i.e. P2P rout...
137
click to vote
DLOG
2009
15 years 2 months ago
2009
Abstract. GridTest is a framework for testing automated theorem provers using randomly generated formulas. It can be used to run tests locally, in a single computer, or in a comput...
170
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
Network virtualization allows one to build dynamic distributed systems in which resources can be dynamically allocated at locations where they are most useful. In order to fully e...
133
click to vote
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
Reinforcement learning promises a generic method for adapting agents to arbitrary tasks in arbitrary stochastic environments, but applying it to new real-world problems remains di...