Sciweavers

286 search results - page 19 / 58
» Design of heat exchanger networks using randomized algorithm
Sort
View
AINA
2010
IEEE
14 years 1 months ago
The Power of Orientation in Symmetry-Breaking
—Symmetry breaking is a fundamental operation in distributed computing. It has applications to important problems such as graph vertex and edge coloring, maximal independent sets...
Satya Krishna Pindiproli, Kishore Kothapalli
DIALM
2008
ACM
140views Algorithms» more  DIALM 2008»
13 years 10 months ago
Latency of opportunistic forwarding in finite regular wireless networks
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
Prithwish Basu, Chi-Kin Chau
SODA
2007
ACM
127views Algorithms» more  SODA 2007»
13 years 10 months ago
Line-of-sight networks
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren ...
MOBIHOC
2004
ACM
14 years 8 months ago
Using labeled paths for loop-free on-demand routing in ad hoc networks
We present the Feasible Label Routing (FLR) protocol for mobile ad hoc networks, which uses path information to establish routes to destinations on demand. FLR enables loopfree in...
Hari Rangarajan, J. J. Garcia-Luna-Aceves
MOBISYS
2009
ACM
14 years 9 months ago
Fidelity-aware replication for mobile devices
Mobile devices often store data in reduced resolutions or custom formats in order to accommodate resource constraints and tailormade software. The Polyjuz framework enables sharin...
Kaushik Veeraraghavan, Venugopalan Ramasubramanian...