3875 search results - page 444 / 775 » Approximation algorithms for the 0-extension problem |
157
click to vote
SWAT
2004
Springer
16 years 2 days ago
2004
Springer
We consider the speed scaling problem of minimizing the average response time of a collection of dynamically released jobs subject to a constraint A on energy used. We propose an ...
189
click to vote
FSTTCS
2003
Springer
15 years 12 months ago
2003
Springer
Computational genomics involves comparing sequences based on “similarity” for detecting evolutionary and functional relationships. Until very recently, available portions of th...
194
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
185
click to vote
SAT
2005
Springer
16 years 6 days ago
2005
Springer
We introduce ApproxCount, an algorithm that approximates the number of satisfying assignments or models of a formula in propositional logic. Many AI tasks, such as calculating degr...
154
click to vote
AAAI
2008
15 years 9 months ago
2008
Most algorithms for computing diagnoses within a modelbased diagnosis framework are deterministic. Such algorithms guarantee soundness and completeness, but are P 2 hard. To overc...