Sciweavers

1740 search results - page 309 / 348
» A Digital Archive of Research Papers in Computer Science
Sort
View
ICALP
1992
Springer
15 years 3 months ago
Near-perfect Token Distribution
Suppose that n tokens are arbitrarily placed on the n nodes of a graph. At each parallel step one token may be moved from each node to an adjacent node. An algorithm for the near-...
Andrei Z. Broder, Alan M. Frieze, Eli Shamir, Eli ...
ICPADS
2006
IEEE
15 years 5 months ago
The Impact of Information Availability and Workload Characteristics on the Performance of Job Co-allocation in Multi-clusters
In this paper, we utilize a bandwidth-centric job communication model that captures the interaction and impact of simultaneously co-allocating jobs across multiple clusters. We ma...
William M. Jones, Walter B. Ligon III, Nishant Shr...
ATAL
2008
Springer
15 years 1 months ago
Using organization knowledge to improve routing performance in wireless multi-agent networks
Multi-agent systems benefit greatly from an organization design that guides agents in determining when to communicate, how often, with whom, with what priority, and so on. However...
Huzaifa Zafar, Victor R. Lesser, Daniel D. Corkill...
CONCURRENCY
2008
119views more  CONCURRENCY 2008»
14 years 11 months ago
InterGrid: a case for internetworking islands of Grids
: Over the last few years, several nations around the world have set up Grids to share resources such as computers, data, and instruments to enable collaborative science, engineeri...
Marcos Dias de Assunção, Rajkumar Bu...
FUIN
2007
134views more  FUIN 2007»
14 years 11 months ago
Complexity Issues in Multiagent Logics
Abstract. Our previous research presents a methodology of cooperative problem solving for beliefdesire-intention (BDI) systems, based on a complete formal theory called TEAMLOG. Th...
Marcin Dziubinski, Rineke Verbrugge, Barbara Dunin...