Sciweavers

1422 search results - page 92 / 285
» Test Generation Algorithms Based on Preorder Relations
Sort
View
EUROPAR
2010
Springer
14 years 11 months ago
Exceptions for Algorithmic Skeletons
Abstract. Algorithmic Skeletons offer high-level abstractions for parallel programming based on recurrent parallelism patterns. Patterns can be combined and nested into more comple...
Mario Leyton, Ludovic Henrio, José M. Pique...
EOR
2006
83views more  EOR 2006»
14 years 10 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...
ALMOB
2008
131views more  ALMOB 2008»
14 years 10 months ago
Fast algorithms for computing sequence distances by exhaustive substring composition
The increasing throughput of sequencing raises growing needs for methods of sequence analysis and comparison on a genomic scale, notably, in connection with phylogenetic tree reco...
Alberto Apostolico, Olgert Denas
RECOMB
2004
Springer
15 years 10 months ago
The Distribution of Inversion Lengths in Bacteria
The distribution of the lengths of genomic segments inverte during the evolutionary divergence of two species cannot be inferred d rectly from the output of genome rearrangement al...
Adrian Maler, David Sankoff, Elisabeth R. M. Tilli...
GECCO
2005
Springer
156views Optimization» more  GECCO 2005»
15 years 3 months ago
Parameterized versus generative representations in structural design: an empirical comparison
Any computational approach to design, including the use of evolutionary algorithms, requires the transformation of the domain-specific knowledge into a formal design representatio...
Rafal Kicinger, Tomasz Arciszewski, Kenneth A. De ...