Sciweavers

5595 search results - page 342 / 1119
» Comparing Subsumption Optimizations
Sort
View
FUIN
2006
139views more  FUIN 2006»
15 years 6 months ago
Efficient Parallel Query Processing by Graph Ranking
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
Dariusz Dereniowski, Marek Kubale
174
Voted
JCSS
2008
80views more  JCSS 2008»
15 years 6 months ago
Improved bounds on sorting by length-weighted reversals
We study the problem of sorting binary sequences and permutations by length-weighted reversals. We consider a wide class of cost functions, namely f( ) = for all 0, where is the...
Michael A. Bender, Dongdong Ge, Simai He, Haodong ...
JUCS
2008
172views more  JUCS 2008»
15 years 6 months ago
A Hybrid Transgenetic Algorithm for the Prize Collecting Steiner Tree Problem
: Evolutionary algorithms are effective search tools for tackling difficult optimization problems. In this paper an algorithm based on living processes where cooperation is the mai...
Elizabeth Ferreira Gouvea Goldbarg, Marco Cé...
AMC
2005
136views more  AMC 2005»
15 years 6 months ago
Solving a dynamic cell formation problem using metaheuristics
In this paper, solving a cell formation (CF) problem in dynamic condition is going to be discussed by using some traditional metaheuristic methods such as genetic algorithm (GA), ...
Reza Tavakkoli-Moghaddam, M. B. Aryanezhad, Nima S...
JCIT
2007
174views more  JCIT 2007»
15 years 6 months ago
Scheduling of scientific workflows using Discrete PSO Algorithm for Grids
Grid computing systems utilize distributive owned and geographically dispersed resources for providing a wide variety of services for various applications. It is possible that the...
Shajulin Benedict V. Vasudevan