Sciweavers

3020 search results - page 277 / 604
» Optimal partition trees
Sort
View
ESA
2009
Springer
109views Algorithms» more  ESA 2009»
16 years 1 months ago
Iterative Rounding for Multi-Objective Optimization Problems
In this paper we show that iterative rounding is a powerful and flexible tool in the design of approximation algorithms for multiobjective optimization problems. We illustrate tha...
Fabrizio Grandoni, R. Ravi, Mohit Singh
EUROGP
2006
Springer
138views Optimization» more  EUROGP 2006»
15 years 10 months ago
Evolving Crossover Operators for Function Optimization
Abstract. A new model for evolving crossover operators for evolutionary function optimization is proposed in this paper. The model is a hybrid technique that combines a Genetic Pro...
Laura Diosan, Mihai Oltean
SIAMDM
2010
117views more  SIAMDM 2010»
15 years 5 months ago
Design is as Easy as Optimization
We consider the class of max-min and min-max optimization problems subject to a global budget (or weight) constraint and we undertake a systematic algorithmic and complexitytheore...
Deeparnab Chakrabarty, Aranyak Mehta, Vijay V. Vaz...
DCC
2006
IEEE
16 years 6 months ago
Optimal Prefix Codes for Some Families of Two-Dimensional Geometric Distributions
Lossless compression is studied for pairs of independent integer-valued symbols emitted by a source with a geometric probability distribution of parameter q (0, 1). Optimal prefix...
Alfredo Viola, Frédérique Bassino, G...
WABI
2001
Springer
112views Bioinformatics» more  WABI 2001»
15 years 11 months ago
Finding an Optimal Inversion Median: Experimental Results
We derive a branch-and-bound algorithm to find an optimal inversion median of three signed permutations. The algorithm prunes to manageable size an extremely large search tree usi...
Adam C. Siepel, Bernard M. E. Moret