Sciweavers

1673 search results - page 302 / 335
» Taming the Dynamics of Distributed Data
Sort
View
POPL
2003
ACM
14 years 10 months ago
New results on the computability and complexity of points - to analysis
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
Venkatesan T. Chakaravarthy
MOBIHOC
2004
ACM
14 years 10 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
PERCOM
2009
ACM
14 years 5 months ago
Auction-Based Congestion Management for Target Tracking in Wireless Sensor Networks
—This paper addresses the problem of providing congestion-management for a shared wireless sensor networkbased target tracking system. In many large-scale wireless sensor network...
Lei Chen 0005, Boleslaw K. Szymanski, Joel W. Bran...
CLUSTER
2008
IEEE
14 years 4 months ago
Active CoordinaTion (ACT) - toward effectively managing virtualized multicore clouds
—A key benefit of utility data centers and cloud computing infrastructures is the level of consolidation they can offer to arbitrary guest applications, and the substantial savi...
Mukil Kesavan, Adit Ranadive, Ada Gavrilovska, Kar...
FOCS
2008
IEEE
14 years 4 months ago
Mixing Time of Exponential Random Graphs
A plethora of random graph models have been developed in recent years to study a range of problems on networks, driven by the wide availability of data from many social, telecommu...
Shankar Bhamidi, Guy Bresler, Allan Sly