Sciweavers

2292 search results - page 397 / 459
» Hierarchical approximation and localization
Sort
View
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
15 years 8 months ago
Combining simplex with niche-based evolutionary computation for job-shop scheduling
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
Syhlin Kuah, Joc Cing Tay
GECCO
2006
Springer
154views Optimization» more  GECCO 2006»
15 years 8 months ago
Spectral techniques for graph bisection in genetic algorithms
Various applications of spectral techniques for enhancing graph bisection in genetic algorithms are investigated. Several enhancements to a genetic algorithm for graph bisection a...
Jacob G. Martin
3DIM
2003
IEEE
15 years 8 months ago
Efficient Reconstruction of Indoor Scenes with Color
In this paper we present an efficient and general approach to computing and integrating 3D distance fields directly from multiple range images. We compute normal and confidence va...
Rui Wang 0003, David P. Luebke
COMPGEOM
2001
ACM
15 years 8 months ago
Discrete mobile centers
We propose a new randomized algorithm for maintaining a set of clusters among moving nodes in the plane. Given a specified cluster radius, our algorithm selects and maintains a va...
Jie Gao, Leonidas J. Guibas, John Hershberger, Li ...
WDAG
1995
Springer
102views Algorithms» more  WDAG 1995»
15 years 8 months ago
Larchant-RDOSS: a Distributed Shared Persistent Memory and its Garbage Collector
Larchant-RDOSS is a distributed shared memory that persists on reliable storage across process lifetimes. Memory management is automatic: including consistent caching of data and ...
Marc Shapiro, Paulo Ferreira