1686 search results - page 9 / 338 » Programs as polygraphs: computability and complexity |
COMPLEXITY
2007
14 years 9 months ago
2007
Distributed computing systems are becoming bigger and more complex. While the complexity of large-scale distributed systems has been acknowledged to be an important challenge, the...
102
click to vote
CSR
2011
Springer
14 years 1 months ago
2011
Springer
Abstract. Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with b...
ICSOC
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. The modularity of Service-oriented Architectures (SOA) allows to establish complex distributed systems comprising e.g., services, clients, brokers, and workflow engines. ...
98
Voted
JAIR
2011
14 years 4 months ago
2011
Bound propagation is an important Artificial Intelligence technique used in Constraint Programming tools to deal with numerical constraints. It is typically embedded within a sea...
FPCA
1989
15 years 1 months ago
1989
One way to analyse programs is to to derive expressions for their computational behaviour. A time bound function (or worst-case complexity) gives an upper bound for the computatio...