Sciweavers

216 search results - page 18 / 44
» A hybrid exact algorithm for complete set partitioning
Sort
View
ISSRE
2007
IEEE
13 years 9 months ago
Generating Trace-Sets for Model-based Testing
Model-checkers are powerful tools that can find individual traces through models to satisfy desired properties. These traces provide solutions to a number of problems. Instead of...
Birgitta Lindström, Paul Pettersson, Jeff Off...
WAOA
2005
Springer
161views Algorithms» more  WAOA 2005»
14 years 29 days ago
"Almost Stable" Matchings in the Roommates Problem
An instance of the classical Stable Roommates problem (sr) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, ...
David J. Abraham, Péter Biró, David ...
ICDE
2007
IEEE
115views Database» more  ICDE 2007»
14 years 1 months ago
A Genetic Approach to Multivariate Microaggregation for Database Privacy
Microaggregation is a technique used to protect privacy in databases and location-based services. We propose a new hybrid technique for multivariate microaggregation. Our techniqu...
Antoni Martínez-Ballesté, Agusti Sol...
BMCBI
2007
106views more  BMCBI 2007»
13 years 7 months ago
Simultaneous identification of long similar substrings in large sets of sequences
Background: Sequence comparison faces new challenges today, with many complete genomes and large libraries of transcripts known. Gene annotation pipelines match these sequences in...
Jürgen Kleffe, Friedrich Möller, Burghar...
DAM
2010
137views more  DAM 2010»
13 years 7 months ago
H-join decomposable graphs and algorithms with runtime single exponential in rankwidth
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshel...