Sciweavers

5331 search results - page 123 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
SIGMOD
2009
ACM
201views Database» more  SIGMOD 2009»
15 years 10 months ago
Cost based plan selection for xpath
We present a complete XPath cost-based optimization and execution framework and demonstrate its effectiveness and efficiency for a variety of queries and datasets. The framework i...
Haris Georgiadis, Minas Charalambides, Vasilis Vas...
EVOW
2004
Springer
15 years 3 months ago
Scatter Search and Memetic Approaches to the Error Correcting Code Problem
We consider the problem of designing error correcting codes (ECC), a hard combinatorial optimization problem of relevance in the field of telecommunications. This problem is tackl...
Carlos Cotta
IWINAC
2007
Springer
15 years 4 months ago
Tackling the Error Correcting Code Problem Via the Cooperation of Local-Search-Based Agents
We consider the problem of designing error correcting codes (ECC), a hard combinatorial optimization problem of relevance in the field of telecommunications. This problem is firs...
Jhon Edgar Amaya, Carlos Cotta, Antonio J. Fern&aa...
GECCO
2006
Springer
282views Optimization» more  GECCO 2006»
15 years 1 months ago
A genetic algorithm for the longest common subsequence problem
A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate subsequences of the shortest or first string. Its fitnes...
Brenda Hinkemeyer, Bryant A. Julstrom
EOR
2006
78views more  EOR 2006»
14 years 10 months ago
A hybrid multistart heuristic for the uncapacitated facility location problem
We present a multistart heuristic for the uncapacitated facility location problem, based on a very successful method we originally developed for the p-median problem. We show exte...
Mauricio G. C. Resende, Renato Fonseca F. Werneck