178 search results - page 13 / 36 » Computing Longest Previous Factor in linear time and applica... |
COMPGEOM
2010
ACM
14 years 1 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...
CLUSTER
2002
IEEE
13 years 8 months ago
2002
IEEE
Abstract. We describe and evaluate the Running Time Advisor (RTA), a system that can predict the running time of a compute-bound task on a typical shared, unreserved commodity host...
ICAC
2006
IEEE
14 years 2 months ago
2006
IEEE
Abstract— Shared computing utilities allocate compute, network, and storage resources to competing applications on demand. An awareness of the demands and behaviors of the hosted...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
IPPS
2005
IEEE
14 years 2 months ago
2005
IEEE
We propose in this paper a heuristic for mapping a set of interacting tasks of a parallel application onto a heterogeneous computing platform such as a computational grid. Our nov...