Sciweavers

406 search results - page 42 / 82
» Pseudorandomness and Combinatorial Constructions
Sort
View
ANTSW
2008
Springer
14 years 1 months ago
Two-Level ACO for Haplotype Inference Under Pure Parsimony
Abstract. Haplotype Inference is a challenging problem in bioinformatics that consists in inferring the basic genetic constitution of diploid organisms on the basis of their genoty...
Stefano Benedettini, Andrea Roli, Luca Di Gaspero
CBSE
2008
Springer
14 years 29 days ago
State Space Reduction Techniques for Component Interfaces
Abstract. Automata-based interface and protocol specifications provide an elegant framework to capture and automatically verify the interactive behavior of component-based software...
Markus Lumpe, Lars Grunske, Jean-Guy Schneider
COLOGNETWENTE
2008
14 years 13 days ago
A Simple 3-Approximation of Minimum Manhattan Networks
Given a set P of n points in the plane, a Manhattan network of P is a network that contains a rectilinear shortest path between every pair of points of P. A minimum Manhattan netw...
Bernhard Fuchs, Anna Schulze
ANTSW
2008
Springer
14 years 3 days ago
Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search
Abstract. Ant colony optimization (ACO) is a metaheuristic that produces good results for a wide range of combinatorial optimization problems. Often such successful applications us...
Frank Neumann, Dirk Sudholt, Carsten Witt
EOR
2006
83views more  EOR 2006»
13 years 11 months ago
Lower bounds and heuristic algorithms for the k
We consider the problem of partitioning a set of positive integers values into a given number of subsets, each having an associated cardinality limit, so that the maximum sum of v...
Mauro Dell'Amico, Manuel Iori, Silvano Martello, M...