663 search results - page 74 / 133 » Algorithms for Computing Minimal Unsatisfiable Subsets of Co... |
PODC
2005
ACM
14 years 1 months ago
2005
ACM
In this paper we consider the weighted, capacitated vertex cover problem with hard capacities (capVC). Here, we are given an undirected graph G = (V, E), non-negative vertex weigh...
ISSS
2000
IEEE
13 years 11 months ago
2000
IEEE
One important part of a HW/SW codesign system is the scheduler which is needed in order to determine if a given HW/SW partitioning is suitable for a given application. In this pap...
VLSID
2003
IEEE
14 years 8 months ago
2003
IEEE
In this paper, we describe two new algorithms for datapath scheduling which aim at energy reduction while maintaining performance. The proposed algorithms, time constrained and re...
BMCBI
2007
13 years 7 months ago
2007
Background: Multiple sequence alignment is fundamental. Exponential growth in computation time appears to be inevitable when an optimal alignment is required for many sequences. E...
PVLDB
2010
13 years 2 months ago
2010
Top-k spatial preference queries return a ranked set of the k best data objects based on the scores of feature objects in their spatial neighborhood. Despite the wide range of loc...