Sciweavers

24 search results - page 1 / 5
» Anytime Coordination Using Separable Bilinear Programs
Sort
View
AAAI
2007
13 years 7 months ago
Anytime Coordination Using Separable Bilinear Programs
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...
Marek Petrik, Shlomo Zilberstein
KBSE
2000
IEEE
13 years 9 months ago
Using Little-JIL to Coordinate Agents in Software Engineering
Little-JIL, a new language for programming the coordination of agents is an executable, high-level process programming language with a formal (yet graphical) syntax and rigorously...
Alexander E. Wise, Aaron G. Cass, Barbara Staudt L...
GPCE
2003
Springer
13 years 10 months ago
SynchNet: A Petri Net Based Coordination Language for Distributed Objects
We present SynchNet, a compositional meta-level language for coordination of distributed. Its design is based on the principle of separation of concerns, namely separation of the c...
Reza Ziaei, Gul Agha
AOSD
2007
ACM
13 years 8 months ago
Generating parallel applications for distributed memory systems using aspects, components, and patterns
Developing and debugging parallel programs particularly for distributed memory architectures is still a difficult task. The most popular approach to developing parallel programs f...
Purushotham V. Bangalore
REFLECTION
2001
Springer
13 years 9 months ago
Separation of Concerns in Mobile Agent Applications
Abstract. Using mobile agent systems, cooperative distributed applications that run over the Internet can be constructed flexibly. However, there are some problems: it is difficul...
Naoyasu Ubayashi, Tetsuo Tamai