1650 search results - page 281 / 330 » The HOM problem is decidable |
SODA
2010
ACM
13 years 6 months ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
ICALP
2011
Springer
12 years 11 months ago
2011
Springer
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...
ICML
1995
IEEE
14 years 8 months ago
1995
IEEE
In the single rent-to-buy decision problem, without a priori knowledge of the amount of time a resource will be used we need to decide when to buy the resource, given that we can ...
RECOMB
2009
Springer
14 years 8 months ago
2009
Springer
Reconciliation between a set of gene trees and a species tree is the most commonly used approach to infer the duplication and loss events in the evolution of gene families, given a...
INFOCOM
2008
IEEE
14 years 2 months ago
2008
IEEE
—Rate allocation is a fundamental problem in the operation of a wireless network because of the necessity to schedule the operation of mutually interfering links between the node...