Sciweavers

6455 search results - page 89 / 1291
» Research problems
Sort
View
103
Voted
FUIN
2008
80views more  FUIN 2008»
15 years 2 months ago
External Memory Algorithms for String Problems
In this paper we present external memory algorithms for some string problems. External memory algorithms have been developed in many research areas, as the speed gap between fast ...
Kangho Roh, Maxime Crochemore, Costas S. Iliopoulo...
104
Voted
CEC
2007
IEEE
15 years 9 months ago
How well do multi-objective evolutionary algorithms scale to large problems
Abstract— In spite of large amount of research work in multiobjective evolutionary algorithms, most have evaluated their algorithms on problems with only two to four objectives. ...
Kata Praditwong, Xin Yao
EOR
2010
84views more  EOR 2010»
15 years 2 months ago
Worst-case analysis of demand point aggregation for the Euclidean p-median problem
Solving large-scale p-median problems is usually time consuming. People often aggregate the demand points in a large-scale p-median problem to reduce its problem size and make it ...
Lian Qi, Zuo-Jun Max Shen
JDA
2008
84views more  JDA 2008»
15 years 2 months ago
Red-blue covering problems and the consecutive ones property
Set Cover problems are of core importance in many applications. In recent research, the "red-blue variants" where blue elements all need to be covered whereas red elemen...
Michael Dom, Jiong Guo, Rolf Niedermeier, Sebastia...
131
Voted
CPAIOR
2009
Springer
15 years 9 months ago
A Shortest Path-Based Approach to the Multileaf Collimator Sequencing Problem
Abstract. The multileaf collimator sequencing problem is an important component in effective cancer treatment delivery. The problem can be formulated as finding a decomposition of...
Hadrien Cambazard, Eoin O'Mahony, Barry O'Sullivan