Sciweavers

200 search results - page 32 / 40
» Dynamic Approaches to In-network Aggregation
Sort
View
EOR
2008
75views more  EOR 2008»
13 years 7 months ago
Soft car sequencing with colors: Lower bounds and optimality proofs
This paper is a study of the car sequencing problem, when feature spacing constraints are soft and colors of vehicles are taken into account. Both pseudo-polynomial algorithms and ...
Thierry Benoist
CN
2006
145views more  CN 2006»
13 years 7 months ago
Understanding optimal data gathering in the energy and latency domains of a wireless sensor network
The problem of optimal data gathering in wireless sensor networks (WSNs) is addressed by means of optimization techniques. The goal of this work is to lay the foundations to devel...
Ugo Monaco, Francesca Cuomo, Tommaso Melodia, Fabi...
IJNSEC
2007
157views more  IJNSEC 2007»
13 years 7 months ago
Balancing Trust and Incentive in Peer-to-Peer Collaborative System
In order to maximize resource utilization as well as providing trust management in P2P computing environments, we propose a novel framework - Trust-Incentive Service Management (T...
Yu Zhang, Li Lin, Jinpeng Huai
ICDE
2005
IEEE
120views Database» more  ICDE 2005»
14 years 8 months ago
Progressive Distributed Top k Retrieval in Peer-to-Peer Networks
Query processing in traditional information management systems has moved from an exact match model to more flexible paradigms allowing cooperative retrieval by aggregating the dat...
Wolf-Tilo Balke, Wolfgang Nejdl, Wolf Siberski, Uw...
SENSYS
2003
ACM
14 years 10 days ago
GEM: graph eMbedding for routing and data-centric storage in sensor networks without geographic information
The widespread deployment of sensor networks is on the horizon. One of the main challenges in sensor networks is to process and aggregate data in the network rather than wasting e...
James Newsome, Dawn Xiaodong Song