Sciweavers

307 search results - page 60 / 62
» The communication complexity of distributed task allocation
Sort
View
89
Voted
AGENTS
2001
Springer
15 years 2 months ago
Matchmaking among minimal agents without a facilitator
Multi-Agent Systems are a promising way of dealing with large complex problems. However, it is not yet clear just how much complexity or pre-existing structure individual agents m...
Elth Ogston, Stamatis Vassiliadis
119
Voted
P2P
2005
IEEE
189views Communications» more  P2P 2005»
15 years 3 months ago
Proximity Neighbor Selection for a DHT in Wireless Multi-Hop Networks
A mobile ad hoc network (MANET) is a multi-hop wireless network having no infrastructure. Thus, the mobile nodes have to perform basic control tasks, such as routing, and higher-l...
Curt Cramer, Thomas Fuhrmann
CAISE
2006
Springer
15 years 1 months ago
Loosely-Coupled Process Automation in Medical Environments
Abstract. We discuss a case study for the hospital scenario where workflow model components are distributed across various computers or devices (e.g. mobile phones, PDAs, sensors, ...
Jurate Vysniauskaite
JSA
2000
115views more  JSA 2000»
14 years 9 months ago
Scheduling optimization through iterative refinement
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...
Mayez A. Al-Mouhamed, Adel Al-Massarani
89
Voted
ISLPED
2003
ACM
129views Hardware» more  ISLPED 2003»
15 years 2 months ago
A critical analysis of application-adaptive multiple clock processors
Enabled by the continuous advancement in fabrication technology, present day synchronous microprocessors include more than 100 million transistors and have clock speeds well in ex...
Emil Talpes, Diana Marculescu