Sciweavers

2621 search results - page 428 / 525
» Near orders and codes
Sort
View
ESA
2004
Springer
96views Algorithms» more  ESA 2004»
15 years 10 months ago
An Experimental Study of Random Knapsack Problems
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
René Beier, Berthold Vöcking
EWSA
2004
Springer
15 years 10 months ago
ArchWare: Architecting Evolvable Software
This paper gives an overview of the ArchWare European Project1 . The broad scope of ArchWare is to respond to the ever-present demand for software systems that are capable of accom...
Flávio Oquendo, Brian Warboys, Ronald Morri...
GECCO
2004
Springer
15 years 10 months ago
Selection-Insertion Schemes in Genetic Algorithms for the Flexible Ligand Docking Problem
Abstract. In this work we have implemented and analyzed the performance of a new real coded steady-state genetic algorithm (SSGA) for the flexible ligand-receptor docking problem....
Camila S. de Magalhães, Helio J. C. Barbosa...
ICCS
2004
Springer
15 years 10 months ago
Platform-Independent Cache Optimization by Pinpointing Low-Locality Reuse
Abstract. For many applications, cache misses are the primary performance bottleneck. Even though much research has been performed on automatically optimizing cache behavior at the...
Kristof Beyls, Erik H. D'Hollander
ISPA
2004
Springer
15 years 10 months ago
A Fault Tolerance Protocol for Uploads: Design and Evaluation
This paper investigates fault tolerance issues in Bistro, a wide area upload architecture. In Bistro, clients first upload their data to intermediaries, known as bistros. A destin...
Leslie Cheung, Cheng-Fu Chou, Leana Golubchik, Yan...