4041 search results - page 226 / 809 » time 2009 |
152
click to vote
NCA
2009
IEEE
16 years 1 months ago
2009
IEEE
—It has been observed in recent years that in many applications service time demands are highly variable. Without foreknowledge of exact service times of individual jobs, process...
175
click to vote
ESOP
2009
Springer
15 years 10 months ago
2009
Springer
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
212
click to vote
COCOON
2009
Springer
16 years 1 months ago
2009
Springer
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...
202
click to vote
DAC
2009
ACM
16 years 7 months ago
2009
ACM
Caches are notorious for their unpredictability. It is difficult or even impossible to predict if a memory access will result in a definite cache hit or miss. This unpredictabilit...
183
click to vote
SOUPS
2009
ACM
16 years 1 months ago
2009
ACM
Privacy in location sharing applications is particularly important due to the sensitivity of users’ geographical location. Privacy in most location sharing applications is provi...