489 search results - page 56 / 98 » Approximation Algorithms for the Minimum-Length Corridor and... |
129
click to vote
SAT
2005
Springer
15 years 9 months 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...
140
click to vote
SPIRE
2010
Springer
15 years 2 months ago
2010
Springer
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
154
click to vote
KDD
2008
ACM
16 years 4 months ago
2008
ACM
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
172
Voted
MOBICOM
2006
ACM
15 years 9 months ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
136
Voted
STACS
1999
Springer
15 years 8 months ago
1999
Springer
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...