Sciweavers

4622 search results - page 894 / 925
» Foundations of Information Theory
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 1 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
ICDCS
2010
IEEE
15 years 1 months ago
Localized Algorithm for Precise Boundary Detection in 3D Wireless Networks
—This research focuses on distributed and localized algorithms for precise boundary detection in 3D wireless networks. Our objectives are in two folds. First, we aim to identify ...
Hongyu Zhou, Su Xia, Miao Jin, Hongyi Wu
ATAL
2006
Springer
15 years 1 months ago
Awareness as a vital ingredient of teamwork
For successful coordination and cooperation in a multiagent system, participants need to establish a sufficiently accurate awareness of the current situation. Awareness is underst...
Barbara Dunin-Keplicz, Rineke Verbrugge
ATAL
2006
Springer
15 years 1 months ago
Integrating agent-oriented methodologies with UML-AT
There are many methodological approaches for Agent-Oriented Software Engineering, each one focusing on some features of multi-agent systems, but leaving others underdefined. For t...
Rubén Fuentes, Jorge J. Gómez-Sanz, ...
ATAL
2006
Springer
15 years 1 months ago
Gradient field-based task assignment in an AGV transportation system
Assigning tasks to agents is complex, especially in highly dynamic environments. Typical protocol-based approaches for task assignment such as Contract Net have proven their value...
Danny Weyns, Nelis Boucké, Tom Holvoet