Sciweavers

5169 search results - page 324 / 1034
» Locality approximation using time
Sort
View
POPL
1995
ACM
15 years 10 months ago
Total Correctness by Local Improvement in Program Transformation
The goal of program transformation is to improve efficiency while preserving meaning. One of the best known transformation techniques is Burstall and Darlington’s unfold-fold me...
David Sands
WINE
2009
Springer
184views Economy» more  WINE 2009»
16 years 1 months ago
Competitive Routing over Time
Congestion games are a fundamental and widely studied model for selfish allocation problems like routing and load balancing. An intrinsic property of these games is that players ...
Martin Hoefer, Vahab S. Mirrokni, Heiko Rögli...
QEST
2010
IEEE
15 years 4 months ago
Transient Analysis of Generalised Semi-Markov Processes Using Transient Stochastic State Classes
The method of stochastic state classes approaches the analysis of Generalised Semi Markov Processes (GSMP) through symbolic derivation of probability density functions over Differe...
András Horváth, Lorenzo Ridi, Enrico...
WEA
2009
Springer
126views Algorithms» more  WEA 2009»
16 years 1 months ago
Computing Elevation Maxima by Searching the Gauss Sphere
The elevation function on a smoothly embedded 2-manifold in R3 reflects the multiscale topography of cavities and protrusions as local maxima. The function has been useful in iden...
Bei Wang, Herbert Edelsbrunner, Dmitriy Morozov
RTAS
2009
IEEE
16 years 1 months ago
Power-Aware CPU Utilization Control for Distributed Real-Time Systems
CPU utilization control has recently been demonstrated to be an effective way of meeting end-to-end deadlines for distributed real-time systems running in unpredictable environmen...
Xiaorui Wang, Xing Fu, Xue Liu, Zonghua Gu