Sciweavers

17329 search results - page 192 / 3466
» Improved non-approximability results
Sort
View
GECCO
1999
Springer
126views Optimization» more  GECCO 1999»
14 years 2 months ago
Improving Genetic Algorithms by Search Space Reductions (with Applications to Flow Shop Scheduling)
Crossover operators that preserve common components can also preserve representation level constraints. Consequently, these constraints can be used to beneficially reduce the sea...
Stephen Y. Chen, Stephen F. Smith
EUROCRYPT
1998
Springer
14 years 2 months ago
How to Improve an Exponentiation Black-Box
Abstract. In this paper we present a method for improving the performance of RSA-type exponentiations. The scheme is based on the observation that replacing the exponent d by d = d...
Gérard D. Cohen, Antoine Lobstein, David Na...
EUROGP
1998
Springer
14 years 2 months ago
Immediate Transfer of Global Improvements to All Individuals in a Population Compared to Automatically Defined Functions for the
Koza has shown how automatically defined functions (ADFs) can reduce computational effort in the GP paradigm. In Koza's ADF, as well as in standard GP, an improvement in a par...
Ricardo Aler
SIGCOMM
1996
ACM
14 years 2 months ago
Analysis of Techniques to Improve Protocol Processing Latency
This paper describes several techniques designed to improve protocol latency, and reports on their effectiveness when measured on a modern RISC machine employing the DEC Alpha pro...
David Mosberger, Larry L. Peterson, Patrick G. Bri...
COOPIS
2004
IEEE
14 years 1 months ago
Refresco: Improving Query Performance Through Freshness Control in a Database Cluster
Abstract. We consider the use of a cluster system for managing autonomous databases. In order to improve the performance of read-only queries, we strive to exploit user requirement...
Cécile Le Pape, Stéphane Ganç...