Sciweavers

14518 search results - page 174 / 2904
» Two Problems for Sophistication
Sort
View
JAL
2006
175views more  JAL 2006»
13 years 10 months ago
Approximations for minimum and min-max vehicle routing problems
: We consider a variety of vehicle routing problems. The input to a problem consists of a graph G = (N, E) and edge lengths l(e) e E. Customers located at the vertices have to be ...
Esther M. Arkin, Refael Hassin, Asaf Levin
RECOMB
2010
Springer
13 years 9 months ago
The Problem of Chromosome Reincorporation in DCJ Sorting and Halving
We study two problems in the double cut and join (DCJ) model: sorting – transforming one multilinear genome into another and halving – transforming a duplicated genome into a p...
Jakub Kovác, Marília D. V. Braga, Je...
CP
2005
Springer
14 years 4 months ago
Caching Search States in Permutation Problems
When the search for a solution to a constraint satisfaction problem backtracks, it is not usually worthwhile to remember the assignment that failed, because the same assignment wil...
Barbara M. Smith
CEC
2009
IEEE
14 years 5 months ago
Tackling high dimensional nonseparable optimization problems by cooperatively coevolving particle swarms
— This paper attempts to address the question of scaling up Particle Swarm Optimization (PSO) algorithms to high dimensional optimization problems. We present a cooperative coevo...
Xiaodong Li, Xin Yao
SOCC
2008
IEEE
124views Education» more  SOCC 2008»
14 years 5 months ago
Energy minimization using a greedy randomized heuristic for the voltage assignment problem in NoC
— Scaling down the voltage levels of the processing elements (PEs) in a Network-on-Chip (NoC) can significantly reduce the computation energy consumption with an overhead of the...
Pavel Ghosh, Arunabha Sen