4860 search results - page 660 / 972 » SNPs Problems, Complexity, and Algorithms |
184
click to vote
ICLP
2010
Springer
15 years 10 months ago
2010
Springer
ABSTRACT. Action-probabilistic logic programs (ap-programs) are a class of probabilistic logic programs that have been extensively used during the last few years for modeling behav...
189
click to vote
FAW
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Computing the visibility polygon, VP, of a point in a polygonal scene, is a classical problem that has been studied extensively. In this paper, we consider the problem of...
172
click to vote
ATVA
2004
Springer
15 years 10 months ago
2004
Springer
While model checking suffers from the state space explosion problem, theorem proving is quite tedious and impractical for verifying complex designs. In this work, we present a veri...
153
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
175
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
In this paper, we study the spread of influence through a social network, in a model initially studied by Kempe, Kleinberg and Tardos [14, 15]: We are given a graph modeling a soc...