827 search results - page 37 / 166 » The Complexity of Probabilistic Lobbying |
95
Voted
ECAI
2006
Springer
15 years 5 months ago
2006
Springer
We present an approach to building libraries of tasks in complex action languages such as Golog, for query answering. Our formalization is based on a situation calculus framework t...
89
Voted
STACS
2010
Springer
15 years 9 months ago
2010
Springer
We call a CNF formula linear if any two clauses have at most one variable in common. We show that there exist unsatisfiable linear k-CNF formulas with at most 4k2 4k clauses, and ...
104
click to vote
IEEEICCI
2003
IEEE
15 years 7 months ago
2003
IEEE
This paper describes a system capable of classifying stochastic, self-affine, nonstationary signals produced by nonlinear systems. The classification and analysis of these signals...
126
Voted
CORR
2006
Springer
15 years 1 months ago
2006
Springer
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; ind...
APAL
2004
15 years 1 months ago
2004
We study the extension (introduced as BT in [5]) of the theory S1 2 by instances of the dual (onto) weak pigeonhole principle for p-time functions, dWPHP(PV )x x2 . We propose a n...