2526 search results - page 57 / 506 » A New Algorithm for Answer Set Computation |
LICS
2009
IEEE
14 years 3 months ago
2009
IEEE
This paper presents a new lower bound for the discrete strategy improvement algorithm for solving parity games due to V¨oge and Jurdzi´nski. First, we informally show which stru...
ICDE
2011
IEEE
13 years 22 days ago
2011
IEEE
— In this paper, we study the problem of efficiently computing multiple aggregation queries over a data stream. In order to share computation, prior proposals have suggested ins...
CONCUR
2001
Springer
14 years 1 months ago
2001
Springer
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
STOC
2005
ACM
14 years 2 months ago
2005
ACM
This paper focuses on competitive function evaluation in the context of computing with priced information. A function f is given together with a cost cx for each variable x of f. ...
ICCV
2005
IEEE
14 years 11 months ago
2005
IEEE
Discriminative learning is challenging when examples are sets of features, and the sets vary in cardinality and lack any sort of meaningful ordering. Kernel-based classification m...