Sciweavers

388 search results - page 56 / 78
» Improving Exact Algorithms for MAX-2-SAT
Sort
View
RTSS
2005
IEEE
14 years 1 months ago
Optimal Task Rate Selection in Fixed Priority Systems
The design phase of any real-time system requires balancing the limited computational resources against the functional requirements and the performance of the application. The opt...
Enrico Bini, Marco Di Natale
DEXA
2005
Springer
80views Database» more  DEXA 2005»
14 years 1 months ago
Optimizing I/O Costs of Multi-dimensional Queries Using Bitmap Indices
Bitmap indices are efficient data structures for processing complex, multi-dimensional queries in data warehouse applications and scientific data analysis. For high-cardinality at...
Doron Rotem, Kurt Stockinger, Kesheng Wu
FCT
1993
Springer
13 years 11 months ago
Generalized Topological Sorting in Linear Time
The generalized topological sorting problem takes as input a positive integer k and a directed, acyclic graph with some vertices labeled by positive integers, and the goal is to la...
Torben Hagerup, Martin Maas
CPM
2004
Springer
107views Combinatorics» more  CPM 2004»
13 years 11 months ago
Sorting by Reversals in Subquadratic Time
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...
Eric Tannier, Marie-France Sagot
AAAI
2008
13 years 9 months ago
Exploiting Causal Independence Using Weighted Model Counting
Previous studies have demonstrated that encoding a Bayesian network into a SAT-CNF formula and then performing weighted model counting using a backtracking search algorithm can be...
Wei Li 0002, Pascal Poupart, Peter van Beek