Sciweavers

511 search results - page 25 / 103
» Using Combinatorial Optimization Methods for Quantification ...
Sort
View
ECCC
2000
140views more  ECCC 2000»
14 years 9 months ago
Randomized Approximation Schemes for Scheduling Unrelated Parallel Machines
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
Pavlos Efraimidis, Paul G. Spirakis
GECCO
2005
Springer
116views Optimization» more  GECCO 2005»
15 years 3 months ago
An empirical study on the handling of overlapping solutions in evolutionary multiobjective optimization
We focus on the handling of overlapping solutions in evolutionary multiobjective optimization (EMO) algorithms. First we show that there exist a large number of overlapping soluti...
Hisao Ishibuchi, Kaname Narukawa, Yusuke Nojima
81
Voted
BMCBI
2008
177views more  BMCBI 2008»
14 years 9 months ago
Baseline Correction for NMR Spectroscopic Metabolomics Data Analysis
Background: We propose a statistically principled baseline correction method, derived from a parametric smoothing model. It uses a score function to describe the key features of b...
Yuanxin Xi, David M. Rocke
COR
2011
14 years 4 months ago
An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows
The Vehicle Routing Problem with Time Windows is a complex combinatorial problem with many real-world applications in transportation and distribution logistics. Its main objective...
Abel Garcia-Najera, John A. Bullinaria
CSCLP
2007
Springer
15 years 3 months ago
Preference-Based Problem Solving for Constraint Programming
Abstract. Combinatorial problems such as scheduling, resource allocation, and configuration have many attributes that can be subject of user preferences. Traditional optimization ...
Ulrich Junker