15033 search results - page 10 / 3007 » Complexity Theory and Algorithms |
134
Voted
ATAL
2010
Springer
15 years 3 months ago
2010
Springer
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
106
click to vote
DCC
2005
IEEE
16 years 1 months ago
2005
IEEE
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
92
Voted
ISSAC
2007
Springer
15 years 8 months ago
2007
Springer
A new randomized algorithm is presented for computing the characteristic polynomial of an n × n matrix over a field. Over a sufficiently large field the asymptotic expected com...
114
click to vote
ISAAC
2005
Springer
15 years 7 months ago
2005
Springer
We characterize the gap between time and space complexity of functions by operators and completeness. First, we introduce a new notion of operators for function complexity classes ...
115
Voted
COLING
1990
15 years 3 months ago
1990
This paper is a first step towards a computational account of Binding Theory (BT). Two algorithms that compute, respectively, Principle A and B have been provided. Particular atte...