Sciweavers

15485 search results - page 380 / 3097
» Computing Optimal Subsets
Sort
View
EC
2010
158views ECommerce» more  EC 2010»
15 years 4 months ago
An Efficient Algorithm for Computing Hypervolume Contributions
The hypervolume indicator serves as a sorting criterion in many recent multi-objective evolutionary algorithms (MOEAs). Typical algorithms remove the solution with the smallest lo...
Karl Bringmann, Tobias Friedrich
ICS
2005
Tsinghua U.
16 years 28 days ago
Optimization of MPI collective communication on BlueGene/L systems
BlueGene/L is currently the world’s fastest supercomputer. It consists of a large number of low power dual-processor compute nodes interconnected by high speed torus and collect...
George Almási, Philip Heidelberger, Charles...
SGP
2007
15 years 9 months ago
Triangulations with locally optimal Steiner points
We present two new Delaunay refinement algorithms, second an extension of the first. For a given input domain (a set of points or a planar straight line graph), and a threshold an...
Hale Erten, Alper Üngör
COMPUTER
2002
75views more  COMPUTER 2002»
15 years 7 months ago
GUI Testing: Pitfalls and Process
ion, so mapping between GUI events and the underlying code is not straightforward. Code-based coverage criteria do not necessarily address problematic interactions between the GUI&...
Atif M. Memon
CVPR
2007
IEEE
16 years 9 months ago
Efficiently Determining Silhouette Consistency
Volume intersection is a frequently used technique to solve the Shape-From-Silhouette problem, which constructs a 3D object estimate from a set of silhouettes taken with calibrate...
Li Yi, David W. Jacobs