Sciweavers

2182 search results - page 82 / 437
» A Robust Algorithm for Solving Nonlinear Programming Problem...
Sort
View
ESA
2007
Springer
122views Algorithms» more  ESA 2007»
13 years 11 months ago
A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem
Abstract. In the present work, we are interested in the practical behavior of a new fptas to solve the approximation version of the 0-1 multiobjective knapsack problem. Nevertheles...
Cristina Bazgan, Hadrien Hugot, Daniel Vanderpoote...
CORR
2010
Springer
85views Education» more  CORR 2010»
13 years 7 months ago
A control-theoretical methodology for the scheduling problem
This paper presents a novel methodology to develop scheduling algorithms. The scheduling problem is phrased as a control problem, and control-theoretical techniques are used to de...
Carlo A. Furia, Alberto Leva, Martina Maggio, Paol...
ICA
2004
Springer
14 years 1 months ago
Robust ICA for Super-Gaussian Sources
Abstract. Most ICA algorithms are sensitive to outliers. Instead of robustifying existing algorithms by outlier rejection techniques, we show how a simple outlier index can be used...
Frank C. Meinecke, Stefan Harmeling, Klaus-Robert ...
CADE
2011
Springer
12 years 7 months ago
Exploiting Symmetry in SMT Problems
Abstract. Methods exploiting problem symmetries have been very successful in several areas including constraint programming and SAT solving. We here recast a technique to enhance t...
David Déharbe, Pascal Fontaine, Stephan Mer...
ANOR
2008
171views more  ANOR 2008»
13 years 7 months ago
A branch and bound method for the job-shop problem with sequence-dependent setup times
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
Christian Artigues, Dominique Feillet