382 search results - page 14 / 77 » Reasoning about the Elementary Functions of Complex Analysis |
JCST
2010
13 years 1 months ago
2010
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
ICNP
2005
IEEE
14 years 9 days ago
2005
IEEE
straction of Complex Network Compositions∗ Azer Bestavros, Adam D. Bradley, Assaf J. Kfoury, and Ibrahim Matta Department of Computer Science Boston University The heterogeneity...
CSL
2004
Springer
14 years 3 days ago
2004
Springer
To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we can describe such notions as the set of nodes reachable from ...
ESOA
2006
13 years 10 months ago
2006
Holonic Multi-Agent Systems (HMAS) are a convenient way to engineer complex and open systems. In such systems, agents have to be able to self-organize to satisfy their goals. Our w...
ATAL
2006
Springer
13 years 10 months ago
2006
Springer
We investigate the computational complexity of reasoning about multi-agent systems using the cooperation logic ATL of Alur, Henzinger, and Kupferman. It is known that satisfiabili...