674 search results - page 41 / 135 » The computational complexity of the parallel knock-out probl... |
102
click to vote
ICDCS
2007
IEEE
2007
IEEE
Exploiting Symbolic Techniques in Automated Synthesis of Distributed Programs with Large State Space
15 years 7 months ago
Automated formal analysis methods such as program verification and synthesis algorithms often suffer from time complexity of their decision procedures and also high space complex...
ICANN
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We investigate the computational capabilities of probabilistic cellular automata by means of the density classification problem. We find that a specific probabilistic ...
APPT
2003
Springer
15 years 6 months ago
2003
Springer
This paper focuses on the problem of scheduling outages to computer systems in complex distributed environments. The interconnected nature of these systems makes scheduling global ...
PPSN
2004
Springer
15 years 6 months ago
2004
Springer
Adaptive multiagent algorithms based upon the behaviour of social insects are powerful decentralised systems capable of solving complex problems. The intelligence of such a system ...
148
click to vote
SPAA
1997
ACM
15 years 5 months ago
1997
ACM
Discovery of association rules is an important database mining problem. Mining for association rules involves extracting patterns from large databases and inferring useful rules f...