1007 search results - page 54 / 202 » The Complexity of Futile Questioning |
131
click to vote
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
It is to date an open question to know how the updating methods affect the evolution of a multi-agent system. This question has been tackled for various complex systems such as ce...
114
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
In many complex multi-agent domains it is impractical to compute exact analytic solutions. An alternate means of analysis applies computational tools to derive and analyze empiric...
108
click to vote
DAGSTUHL
2006
15 years 5 months ago
2006
Multisource information theory in Shannon setting is well known. In this article we try to develop its algorithmic information theory counterpart and use it as the general framewo...
138
click to vote
TOC
2010
14 years 10 months ago
2010
: We show that a noisy parallel decision tree making O(n) queries needs (log n) rounds to compute OR of n bits. This answers a question of Newman [IEEE Conference on Computational ...
158
click to vote
ECCC
2010
15 years 2 months ago
2010
We study the problem of testing isomorphism (equivalence up to relabelling of the variables) of two Boolean functions f, g : {0, 1}n → {0, 1}. Our main focus is on the most stud...