Sciweavers

7522 search results - page 421 / 1505
» Spacing memetic algorithms
Sort
View
SODA
2001
ACM
188views Algorithms» more  SODA 2001»
15 years 9 months ago
Approximation algorithms for the 0-extension problem
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
Gruia Calinescu, Howard J. Karloff, Yuval Rabani
TIFS
2008
157views more  TIFS 2008»
15 years 7 months ago
Subspace Approximation of Face Recognition Algorithms: An Empirical Study
We present a theory for constructing linear subspace approximations to face-recognition algorithms and empirically demonstrate that a surprisingly diverse set of face-recognition a...
Pranab Mohanty, Sudeep Sarkar, Rangachar Kasturi, ...
EC
2002
228views ECommerce» more  EC 2002»
15 years 7 months ago
Improved Sampling of the Pareto-Front in Multiobjective Genetic Optimizations by Steady-State Evolution: A Pareto Converging Gen
Previous work on multiobjective genetic algorithms has been focused on preventing genetic drift and the issue of convergence has been given little attention. In this paper, we pre...
Rajeev Kumar, Peter Rockett
MOR
2002
94views more  MOR 2002»
15 years 7 months ago
The Complexity of Generic Primal Algorithms for Solving General Integer Programs
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
Andreas S. Schulz, Robert Weismantel
HIPC
2009
Springer
15 years 5 months ago
Highly scalable algorithm for distributed real-time text indexing
Stream computing research is moving from terascale to petascale levels. It aims to rapidly analyze data as it streams in from many sources and make decisions with high speed and a...
Ankur Narang, Vikas Agarwal, Monu Kedia, Vijay K. ...