Sciweavers

909 search results - page 160 / 182
» On the approximability of some network design problems
Sort
View
IPPS
2008
IEEE
14 years 1 months ago
A study of master-slave approaches to parallelize NSGA-II
Many of the optimization problems from the real world are multiobjective in nature, and the reference algorithm for multiobjective optimization is NSGA-II. Frequently, these probl...
Juan José Durillo, Antonio J. Nebro, Franci...
CONCUR
2004
Springer
14 years 24 days ago
Open Maps, Alternating Simulations and Control Synthesis
Abstract. Control synthesis is slowly transcending its traditional application domain within engineering to find interesting and useful applications in computer science. Synthesis...
Paulo Tabuada
COCOON
2006
Springer
13 years 11 months ago
Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms
In a recent article, Nakhleh, Ringe and Warnow introduced perfect phylogenetic networks--a model of language evolution where languages do not evolve via clean speciation--and form...
Iyad A. Kanj, Luay Nakhleh, Ge Xia
EMO
2009
Springer
140views Optimization» more  EMO 2009»
14 years 1 days ago
On Using Populations of Sets in Multiobjective Optimization
Abstract. Most existing evolutionary approaches to multiobjective optimization aim at finding an appropriate set of compromise solutions, ideally a subset of the Pareto-optimal se...
Johannes Bader, Dimo Brockhoff, Samuel Welten, Eck...
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
14 years 7 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking