Sciweavers

3143 search results - page 281 / 629
» Minimization of entropy functionals
Sort
View
127
Voted
CEC
2005
IEEE
15 years 10 months ago
On the complexity of overcoming gaps with isotropic mutations and elitist selection
We consider the (1+λ) evolution strategy, an evolutionary algorithm for minimization in Rn , using isotropic mutations. Thus, for instance, Gaussian mutations adapted by the 1/5-r...
Jens Jägersküpper
DATE
2005
IEEE
99views Hardware» more  DATE 2005»
15 years 10 months ago
A New System Design Methodology for Wire Pipelined SoC
Wire Pipelining (WP) has been proposed in order to limit the impact of increasing wire delays. In general, the added pipeline elements alters the system such that architectural ch...
Mario R. Casu, Luca Macchiarulo
156
Voted
IPPS
2005
IEEE
15 years 10 months ago
Optimal Mapping of a Parallel Application Processes onto Heterogeneous Platform
The paper is devoted to analysis of a strategy of computation distribution on heterogeneous parallel systems. According to this strategy processes of parallel program are distribu...
Alexey Kalinov, Sergey Klimov
ASIACRYPT
2005
Springer
15 years 10 months ago
Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation
We propose Gate Evaluation Secret Sharing (GESS) – a new kind of secret sharing, designed for use in secure function evaluation (SFE) with minimal interaction. The resulting simp...
Vladimir Kolesnikov
COCOON
2005
Springer
15 years 10 months ago
The Reverse Greedy Algorithm for the Metric K-Median Problem
The Reverse Greedy algorithm (RGREEDY) for the k-median problem works as follows. It starts by placing facilities on all nodes. At each step, it removes a facility to minimize the...
Marek Chrobak, Claire Kenyon, Neal E. Young