Sciweavers

23557 search results - page 4107 / 4712
» Distributed Computing - Introduction
Sort
View
CONCUR
2007
Springer
16 years 24 days ago
Asynchronous Games: Innocence Without Alternation
The notion of innocent strategy was introduced by Hyland and Ong in order to capture the interactive behaviour of λ-terms and PCF programs. An innocent strategy is defined as an ...
Paul-André Melliès, Samuel Mimram
DCOSS
2007
Springer
16 years 24 days ago
Localization for Anchoritic Sensor Networks
We introduce a class of anchoritic sensor networks, where communications between sensor nodes are undesirable or infeasible due to, e.g., harsh environments, energy constraints, or...
Yuliy M. Baryshnikov, Jian Tan
DCOSS
2007
Springer
16 years 24 days ago
A Semantics-Based Middleware for Utilizing Heterogeneous Sensor Networks
With the proliferation of various kinds of sensor networks, we will see large amounts of heterogeneous data. They have different characteristics such as data content, formats, mod...
Eric Bouillet, Mark Feblowitz, Zhen Liu, Anand Ran...
DCOSS
2007
Springer
16 years 24 days ago
Optimal Cluster Association in Two-Tiered Wireless Sensor Networks
Abstract. In this paper, we study the two-tiered wireless sensor network (WSN) architecture and propose the optimal cluster association algorithm for it to maximize the overall net...
Weizhao Wang, Wen-Zhan Song, Xiang-Yang Li, Kousha...
DCOSS
2007
Springer
16 years 24 days ago
A Compilation Framework for Macroprogramming Networked Sensors
Macroprogramming—the technique of specifying the behavior of the system, as opposed to the constituent nodes—provides application developers with high level abstractions that a...
Animesh Pathak, Luca Mottola, Amol Bakshi, Viktor ...
« Prev « First page 4107 / 4712 Last » Next »