Sciweavers

2109 search results - page 282 / 422
» Solving Necklace Constraint Problems
Sort
View
EOR
2006
129views more  EOR 2006»
15 years 5 months ago
Balancing assembly lines with tabu search
Balancing assembly lines is a crucial task for manufacturing companies in order to improve productivity and minimize production costs. Despite some progress in exact methods to so...
Sophie D. Lapierre, Angel B. Ruiz, Patrick Soriano
TCBB
2008
122views more  TCBB 2008»
15 years 4 months ago
Mixed Integer Linear Programming for Maximum-Parsimony Phylogeny Inference
Reconstruction of phylogenetic trees is a fundamental problem in computational biology. While excellent heuristic methods are available for many variants of this problem, new adva...
Srinath Sridhar, Fumei Lam, Guy E. Blelloch, R. Ra...
ML
2002
ACM
127views Machine Learning» more  ML 2002»
15 years 4 months ago
Sparse Regression Ensembles in Infinite and Finite Hypothesis Spaces
We examine methods for constructing regression ensembles based on a linear program (LP). The ensemble regression function consists of linear combinations of base hypotheses generat...
Gunnar Rätsch, Ayhan Demiriz, Kristin P. Benn...
LION
2009
Springer
145views Optimization» more  LION 2009»
15 years 11 months ago
A Variable Neighborhood Descent Search Algorithm for Delay-Constrained Least-Cost Multicast Routing
Abstract. The rapid evolution of real-time multimedia applications requires Quality of Service (QoS) based multicast routing in underlying computer networks. The constrained Steine...
Rong Qu, Ying Xu, Graham Kendall
132
Voted
PATAT
2004
Springer
138views Education» more  PATAT 2004»
15 years 10 months ago
Semantic Components for Timetabling
Abstract. Automated timetabling is a research domain that has occupied many researchers over the last 50 years. Several algorithms have proven to be applicable to timetabling but t...
Nele Custers, Patrick De Causmaecker, Peter Demees...