Sciweavers

286 search results - page 47 / 58
» Design of heat exchanger networks using randomized algorithm
Sort
View
SPAA
1997
ACM
13 years 12 months ago
Accessing Nearby Copies of Replicated Objects in a Distributed Environment
Consider a set of shared objects in a distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as e ...
C. Greg Plaxton, Rajmohan Rajaraman, Andréa...
MOBIHOC
2005
ACM
14 years 7 months ago
Low-coordination topologies for redundancy in sensor networks
Tiny, low-cost sensor devices are expected to be failure-prone and hence in many realistic deployment scenarios for sensor networks these nodes are deployed in higher than necessa...
Rajagopal Iyengar, Koushik Kar, Suman Banerjee
MOBIHOC
2008
ACM
14 years 7 months ago
Localized distance-sensitive service discovery in wireless sensor networks
In this paper, we identify a new problem in wireless sensor networks, distance sensitive service discovery, where nearby or closest service selection guarantee is expected. We pro...
Xu Li, Nicola Santoro, Ivan Stojmenovic
ISCC
2003
IEEE
153views Communications» more  ISCC 2003»
14 years 1 months ago
Fuzzy Explicit Marking for Congestion Control in Differentiated Services Networks
This paper presents a new active queue management scheme, Fuzzy Explicit Marking (FEM), implemented within the differentiated services (Diff-Serv) framework to provide congestion ...
Chrysostomos Chrysostomou, Andreas Pitsillides, Ge...
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
14 years 5 months ago
Counting Stars and Other Small Subgraphs in Sublinear Time
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Mira Gonen, Dana Ron, Yuval Shavitt