2095 search results - page 375 / 419 » Improved pebbling bounds |
154
click to vote
LCTRTS
2005
Springer
15 years 11 months ago
2005
Springer
Real-time garbage collection has been shown to be feasible, but for programs with high allocation rates, the utilization achievable is not sufficient for some systems. Since a hi...
182
click to vote
MOBICOM
2003
ACM
15 years 11 months ago
2003
ACM
In this paper, we consider the transport capacity of ad hoc networks with a random flat topology under the present support of an infinite capacity infrastructure network. Such a...
179
click to vote
SPAA
2003
ACM
15 years 11 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
153
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
163
click to vote
ASPLOS
2000
ACM
15 years 10 months ago
2000
ACM
Multiprocessing is already prevalent in servers where multiple clients present an obvious source of thread-level parallelism. However, the case for multiprocessing is less clear f...