Sciweavers

759 search results - page 16 / 152
» What Can Be Implemented Anonymously
Sort
View
ALGOSENSORS
2006
Springer
14 years 1 months ago
Efficient Training of Sensor Networks
Abstract. Due to their small form factor and modest energy budget, individual sensors are not expected to be GPS-enabled. Moreover, in most applications, exact geographic location ...
Alan A. Bertossi, Stephan Olariu, Maria Cristina P...
ISSTA
2012
ACM
12 years 8 days ago
Measuring enforcement windows with symbolic trace interpretation: what well-behaved programs say
A static analysis design is sufficient if it can prove the property of interest with an acceptable number of false alarms. Ultimately, the only way to confirm that an analysis d...
Devin Coughlin, Bor-Yuh Evan Chang, Amer Diwan, Je...
AGP
2010
IEEE
14 years 1 months ago
Agents, Multi-Agent Systems and Declarative Programming: What, When, Where, Why, Who, How?
This chapter tackles the relation between declarative languages and multi-agent systems by following the dictates of the five Ws (and one H) that characterize investigations. The ...
Matteo Baldoni, Cristina Baroglio, Viviana Mascard...
ISORC
2002
IEEE
14 years 2 months ago
IKE 2-Implementing the Stateful Distributed Object Paradigm
— This paper describes IKE 2, which is distributed object computing middleware that supports the creation of interoperable realtime distributed applications. These applications a...
J. Russell Noseworthy
WDAG
2007
Springer
82views Algorithms» more  WDAG 2007»
14 years 4 months ago
The Space Complexity of Unbounded Timestamps
The timestamp problem captures a fundamental aspect of asynchronous distributed computing. It allows processes to label events throughout the system with timestamps that provide in...
Faith Ellen, Panagiota Fatourou, Eric Ruppert