Sciweavers

1486 search results - page 115 / 298
» Algorithms for two-box covering
Sort
View
DISOPT
2006
155views more  DISOPT 2006»
15 years 4 months ago
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms
We consider the multiple shift scheduling problem modelled as a covering problem. Such problems are characterized by a constraint matrix that has in every column blocks of consecu...
Dorit S. Hochbaum, Asaf Levin
143
Voted
JSW
2008
136views more  JSW 2008»
15 years 4 months ago
Collaborative Product Configuration: Formalization and Efficient Algorithms for Dependency Analysis
- In the Software Product Line approach, product configuration is a key activity in which stakeholders choose features for a product. This activity is critical in the sense that ca...
Marcílio Mendonça, Donald D. Cowan, ...
LICS
2003
IEEE
15 years 9 months ago
Polynomial-time Algorithms from Ineffective Proofs
We present a constructive procedure for extracting polynomial-time realizers from ineffective proofs of Π0 2theorems in feasible analysis. By ineffective proof we mean a proof wh...
Paulo Oliva
CSB
2004
IEEE
109views Bioinformatics» more  CSB 2004»
15 years 7 months ago
Rec-I-DCM3: A Fast Algorithmic Technique for Reconstructing Large Phylogenetic Trees
Phylogenetic trees are commonly reconstructed based on hard optimization problems such as maximum parsimony (MP) and maximum likelihood (ML). Conventional MP heuristics for produc...
Usman Roshan, Bernard M. E. Moret, Tandy Warnow, T...
ISI
2006
Springer
15 years 4 months ago
Towards Optimal Police Patrol Routes with Genetic Algorithms
It is quite consensual that police patrolling can be regarded as one of the best well-known practices for implementing public-safety preventive policies towards the combat of an as...
Danilo Reis, Adriano Melo, André L. V. Coel...