13 search results - page 2 / 3 » Verifying time, memory and communication bounds in systems o... |
IJCAI
1993
13 years 6 months ago
1993
agent-oriented system. We show the complexity to be linear time for one of these logics and polynomial time for another, thus providing encouraging results with respect to the prac...
FORTE
2001
13 years 6 months ago
2001
The Algebra of Communicating Shared Resources (ACSR) is a timed process algebra which extends classical process algebras with the notion of a resource. It takes the view that the ...
IEEEPACT
1998
IEEE
13 years 9 months ago
1998
IEEE
Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...
ATAL
2006
Springer
13 years 8 months ago
2006
Springer
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
CDC
2008
IEEE
13 years 11 months ago
2008
IEEE
— We come up with novel quantized averaging algorithms on synchronous and asynchronous communication networks with fixed, switching and random topologies. The implementation of ...