516 search results - page 50 / 104 » Generalizing the Discrete Timed Automaton |
MST
2010
13 years 4 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
PODC
2005
ACM
14 years 3 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
GIS
2005
ACM
14 years 11 months ago
2005
ACM
An interesting issue in moving objects databases is to find similar trajectories of moving objects. Previous work on this topic focuses on movement patterns (trajectories with tim...
COMPGEOM
1994
ACM
14 years 2 months ago
1994
ACM
We give simple randomized incremental algorithms for computing the k-level in an arrangement of n lines in the plane or in an arrangement of n planes in R3. The expected running ti...
DAC
2010
ACM
2010
ACM
A probabilistic and energy-efficient scheduling approach for online application in real-time systems
14 years 1 months ago
This work considers the problem of minimizing the power consumption for real-time scheduling on processors with discrete operating modes. We provide a model for determining the ex...