725 search results - page 24 / 145 » A General Greedy Approximation Algorithm with Applications |
120
click to vote
ALGORITHMICA
2011
14 years 4 months ago
2011
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
This paper introduces a new algorithm for solving a subclass of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified ine...
ENTCS
2008
14 years 9 months ago
2008
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
101
click to vote
SACMAT
2006
ACM
15 years 3 months ago
2006
ACM
We introduce the concept, model, and policy-specific algorithms for inferring new access control decisions from previous ones. Our secondary and approximate authorization model (...
RECOMB
2003
Springer
15 years 10 months ago
2003
Springer
Genetic linkage analysis is a challenging application which requires Bayesian networks consisting of thousands of vertices. Consequently, computing the likelihood of data, which i...