Sciweavers

580 search results - page 61 / 116
» Choosing a random peer
Sort
View
EUROCRYPT
2007
Springer
15 years 6 months ago
Simulatable Adaptive Oblivious Transfer
We study an adaptive variant of oblivious transfer in which a sender has N messages, of which a receiver can adaptively choose to receive k one-after-the-other, in such a way that ...
Jan Camenisch, Gregory Neven, Abhi Shelat
WIOPT
2006
IEEE
15 years 5 months ago
Capacity optimizing hop distance in a mobile ad hoc network with power control
Abstract— In a dense multi-hop network of mobile nodes capable of applying adaptive power control, we consider the problem of finding the optimal hop distance that maximizes a c...
Dinesh Kumar 0002, Venkatesh Ramaiyan, Anurag Kuma...
IPPS
2005
IEEE
15 years 5 months ago
Optimal Oblivious Path Selection on the Mesh
— In the oblivious path selection problem, each packet in the network independently chooses a path, which is an important property if the routing algorithm is to be independent o...
Costas Busch, Malik Magdon-Ismail, Jing Xi
GECCO
2005
Springer
154views Optimization» more  GECCO 2005»
15 years 5 months ago
Genetic algorithms using low-discrepancy sequences
The random number generator is one of the important components of evolutionary algorithms (EAs). Therefore, when we try to solve function optimization problems using EAs, we must ...
Shuhei Kimura, Koki Matsumura
DAC
2004
ACM
15 years 3 months ago
Probabilistic regression suites for functional verification
Random test generators are often used to create regression suites on-the-fly. Regression suites are commonly generated by choosing several specifications and generating a number o...
Shai Fine, Shmuel Ur, Avi Ziv