Sciweavers

8141 search results - page 1250 / 1629
» Higher Order Generalization
Sort
View
SODA
2001
ACM
87views Algorithms» more  SODA 2001»
15 years 7 months ago
Gossip is synteny: incomplete gossip and an exact algorithm for syntenic distance
The syntenic distance between two genomes is given by the minimum number of fusions, fissions, and translocations required to transform one into the other, ignoring the order of g...
David Liben-Nowell
SSR
2001
69views more  SSR 2001»
15 years 7 months ago
Managing variability in software architectures
This paper presents experience with explicitly managing variability within a software architecture. Software architects normally plan for change and put mechanisms in the architec...
Felix Bachmann, Leonard J. Bass
IJCAI
2003
15 years 7 months ago
Backdoors To Typical Case Complexity
There has been significant recent progress in reasoning and constraint processing methods. In areas such as planning and finite model-checking, current solution techniques can h...
Ryan Williams, Carla P. Gomes, Bart Selman
STRINGOLOGY
2004
15 years 7 months ago
Conditional Inequalities and the Shortest Common Superstring Problem
We investigate the shortest common superstring problem (SCSSP). As SCSSP is APX-complete it cannot be approximated within an arbitrarily small performance ratio. One heuristic tha...
Uli Laube, Maik Weinard
ISCAPDCS
2003
15 years 7 months ago
Optimal Graph Transformation Assuming Alternate Scheduling Models
Many computation-intensive iterative or recursive applications commonly found in digital signal processing and image processing applications can be represented by data-flow graph...
Timothy W. O'Neil
« Prev « First page 1250 / 1629 Last » Next »