93 search results - page 18 / 19 » What Makes the Arc-Preserving Subsequence Problem Hard |
233
click to vote
ASPLOS
2009
ACM
16 years 4 months ago
2009
ACM
This paper presents a surprising result: changing a seemingly innocuous aspect of an experimental setup can cause a systems researcher to draw wrong conclusions from an experiment...
145
click to vote
ASPLOS
2010
ACM
15 years 11 months ago
2010
ACM
Computer systems often fail due to many factors such as software bugs or administrator errors. Diagnosing such production run failures is an important but challenging task since i...
158
click to vote
IEEEPACT
2006
IEEE
15 years 10 months ago
2006
IEEE
As chip multiprocessors (CMPs) become increasingly mainstream, architects have likewise become more interested in how best to share a cache hierarchy among multiple simultaneous t...
150
click to vote
SPAA
2004
ACM
15 years 9 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
124
Voted
SIGMETRICS
2003
ACM
15 years 9 months ago
2003
ACM
It is commonly agreed that scheduling mechanisms in general purpose operating systems do not provide adequate support for modern interactive applications, notably multimedia appli...