153 search results - page 3 / 31 » Some Decision Problems of Enormous Complexity |
EEF
2000
13 years 9 months ago
2000
Both the logic and the stochastic analysis of discrete-state systems are hindered by the combinatorial growth of the state space underlying a high-level model. In this work, we con...
HICSS
2005
IEEE
13 years 11 months ago
2005
IEEE
Decision making processes and systems to support the same have focused for the most part on narrow disciplines, paradigms, perspectives, and pre-determined processes. Apart from t...
COCO
1991
Springer
13 years 8 months ago
1991
Springer
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
KDD
2009
ACM
14 years 5 months ago
2009
ACM
Nowadays, enormous amounts of data are continuously generated not only in massive scale, but also from different, sometimes conflicting, views. Therefore, it is important to conso...
STOC
2009
ACM
14 years 6 months ago
2009
ACM
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...