Sciweavers

1710 search results - page 323 / 342
» High-Level Programs and Program Conditions
Sort
View
ICALP
2009
Springer
14 years 8 months ago
Tight Bounds for the Cover Time of Multiple Random Walks
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...
Robert Elsässer, Thomas Sauerwald
SIGMOD
2004
ACM
262views Database» more  SIGMOD 2004»
14 years 8 months ago
The Next Database Revolution
Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database ...
Jim Gray
PERCOM
2007
ACM
14 years 7 months ago
The RUNES Middleware for Networked Embedded Systems and its Application in a Disaster Management Scenario
Due to the inherent nature of their heterogeneity, resource scarcity and dynamism, the provision of middleware for future networked embedded environments is a challenging task. In...
Paolo Costa, Geoff Coulson, Richard Gold, Manish L...
MOBIHOC
2003
ACM
14 years 7 months ago
SHARP: a hybrid adaptive routing protocol for mobile ad hoc networks
A central challenge in ad hoc networks is the design of routing protocols that can adapt their behavior to frequent and rapid changes in the network. The performance of proactive ...
Venugopalan Ramasubramanian, Zygmunt J. Haas, Emin...
HYBRID
2010
Springer
14 years 2 months ago
Automatic invariant generation for hybrid systems using ideal fixed points
We present computational techniques for automatically generating algebraic (polynomial equality) invariants for algebraic hybrid systems. Such systems involve ordinary differentia...
Sriram Sankaranarayanan