Sciweavers

453 search results - page 71 / 91
» On Approximation of Bookmark Assignments
Sort
View
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
13 years 11 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
3DIM
2003
IEEE
13 years 11 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
FSTTCS
2000
Springer
13 years 11 months ago
Text Sparsification via Local Maxima
In this paper we investigate some properties and algorithms related to a text sparsification technique based on the identification of local maxima in the given string. As the numb...
Pierluigi Crescenzi, Alberto Del Lungo, Roberto Gr...
ICML
1994
IEEE
13 years 11 months ago
Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithms
With the goal of reducing computational costs without sacrificing accuracy, we describe two algorithms to find sets of prototypes for nearest neighbor classification. Here, the te...
David B. Skalak
CONEXT
2005
ACM
13 years 9 months ago
Optimal positioning of active and passive monitoring devices
Network measurement is essential for assessing performance issues, identifying and locating problems. Two common strategies are the passive approach that attaches specific device...
Claude Chaudet, Eric Fleury, Isabelle Guéri...