1401 search results - page 156 / 281 » Randomness in Interactive Proofs |
CEC
2005
IEEE
15 years 3 months ago
2005
IEEE
This paper proposes a genetic algorithm (GA) with random immigrants for dynamic optimization problems where the worst individual and its neighbours are replaced every generation. I...
116
click to vote
ICRA
2005
IEEE
15 years 3 months ago
2005
IEEE
Abstract— We present a simple randomized POMDP algorithm for planning with continuous actions in partially observable environments. Our algorithm operates on a set of reachable b...
INFOCOM
2005
IEEE
15 years 3 months ago
2005
IEEE
Abstract— In a peer-to-peer network, nodes are typically required to route packets for each other. This leads to a problem of “free-loaders,” nodes that use the network but r...
WAC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. There is an increasing consensus that existing mobility models, such as the well-known random walk or random waypoint models, are insufficient to represent real node mobi...
ASIACRYPT
2000
Springer
15 years 2 months ago
2000
Springer
Block ciphers are usually based on one top-level scheme into which we plug “round functions”. To analyze security, it is important to study the intrinsic security provided by t...