Sciweavers

3422 search results - page 96 / 685
» Random Subset Optimization
Sort
View
PODC
1998
ACM
15 years 6 months ago
Amortizing Randomness in Private Multiparty Computations
We study the relationship between the number of rounds needed to repeatedly perform a private computation i.e., where there are many sets of inputs sequentially given to the play...
Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosé...
110
Voted
CCE
2006
15 years 2 months ago
Design of heat exchanger networks using randomized algorithm
A randomized algorithm with stream splitting for design of heat exchanger networks is presented in this work. The algorithm has provisions for splitting any one of the process str...
Ankur Pariyani, Abhigyan Gupta, Pallab Ghosh
DFT
2008
IEEE
103views VLSI» more  DFT 2008»
15 years 9 months ago
Arbitrary Error Detection in Combinational Circuits by Using Partitioning
The paper presents a new technique for designing a concurrently checking combinational circuit. The technique is based on partitioning the circuit into two independent sub-circuit...
Osnat Keren, Ilya Levin, Vladimir Ostrovsky, Beni ...
96
Voted
GECCO
2007
Springer
141views Optimization» more  GECCO 2007»
15 years 8 months ago
Evolving robust GP solutions for hedge fund stock selection in emerging markets
Abstract Stock selection for hedge fund portfolios is a challenging problem for Genetic Programming (GP) because the markets (the environment in which the GP solution must survive)...
Wei Yan, Christopher D. Clack
IANDC
2007
106views more  IANDC 2007»
15 years 2 months ago
Extended visual cryptography schemes
Visual cryptography schemes have been introduced in 1994 by Naor and Shamir. Their idea was to encode a secret image into n shadow images and to give exactly one such shadow image ...
Andreas Klein, Markus Wessler