Sciweavers

6584 search results - page 1295 / 1317
» Distributed Shared Contexts
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
14 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
EXPCS
2007
14 years 1 months ago
The user in experimental computer systems research
Experimental computer systems research typically ignores the end-user, modeling him, if at all, in overly simple ways. We argue that this (1) results in inadequate performance eva...
Peter A. Dinda, Gokhan Memik, Robert P. Dick, Bin ...
CASES
2004
ACM
14 years 1 months ago
Providing time- and space- efficient procedure calls for asynchronous software thread integration
Asynchronous Software Thread Integration (ASTI) provides fine-grain concurrency in real-time threads by statically scheduling (integrating) code from primary threads into secondar...
Vasanth Asokan, Alexander G. Dean
ATAL
2006
Springer
14 years 1 months ago
Adaptive agent negotiation via argumentation
In this paper, we study how argumentation can be used as a basis for negotiation between autonomous agents, where negotiation strategies of the different parties are represented a...
Antonis C. Kakas, Pavlos Moraitis
ATAL
2006
Springer
14 years 1 months ago
A utility-based sensing and communication model for a glacial sensor network
This paper reports on the development of a utility-based mechanism for managing sensing and communication in cooperative multi-sensor networks. The specific application considered...
Paritosh Padhy, Rajdeep K. Dash, Kirk Martinez, Ni...
« Prev « First page 1295 / 1317 Last » Next »