7129 search results - page 734 / 1426 » Approximation Algorithms for Treewidth |
183
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
In the minimum entropy set cover problem, one is given a collection of k sets which collectively cover an n-element ground set. A feasible solution of the problem is a partition o...
165
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
Data representing moving objects is rapidly getting more available, especially in the area of wildlife GPS tracking. It is a central belief that information is hidden in large data...
222
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...
237
click to vote
PEPM
1995
ACM
15 years 10 months ago
1995
ACM
This paper concerns a method for approximating the possible “shapes” that heap-allocated structures in a program can take on. We present a new approach to finding solutions t...
187
click to vote
IJCAI
2007
15 years 8 months ago
2007
Diagnosability of systems is an essential property that determines how accurate any diagnostic reasoning can be on a system given any sequence of observations. Generally, in the l...