Sciweavers

260 search results - page 38 / 52
» Dynamic Random Geometric Graphs
Sort
View
GLOBECOM
2010
IEEE
14 years 7 months ago
A Distributed Wake-Up Scheduling for Opportunistic Forwarding in Wireless Sensor Networks
In wireless sensor networks (WSNs), sensor nodes are typically subjected to energy constraints and often prone to topology changes. While duty cycling has been widely used for ener...
Chul-Ho Lee, Do Young Eun
DCOSS
2006
Springer
15 years 1 months ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama
CP
2006
Springer
15 years 1 months ago
Reasoning by Dominance in Not-Equals Binary Constraint Networks
Dynamic detection and elimination of symmetry in constraints, is in general a hard task, but in Not-Equals binary constraint networks, the symmetry conditions can be simplified. I...
Belaid Benhamou, Mohamed Réda Saïdi
68
Voted
ICITA
2005
IEEE
15 years 3 months ago
Using Image Contour Recognition in GIS Navigation
This paper presents an approach of using image contour recognition in the navigation for enterprise geographic information systems (GIS). The extraction of object mark images is b...
Wei Lai, Donggang Yu, Jiro Tanaka, Cai Fei
INFOCOM
2003
IEEE
15 years 3 months ago
Interaction of TCP Flows as Billiards
Abstract— The aim of this paper is to analyze the performance of a large number of long lived TCP controlled flows sharing many routers (or links), from the knowledge of the net...
François Baccelli, Dohy Hong