5169 search results - page 129 / 1034 » Locality approximation using time |
138
click to vote
ACMMSP
2004
ACM
15 years 10 months ago
2004
ACM
Irregular applications frequently exhibit poor performance on contemporary computer architectures, in large part because of their inefficient use of the memory hierarchy. Runtime ...
134
click to vote
ECCC
2000
15 years 4 months ago
2000
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
138
click to vote
DCG
2010
15 years 4 months ago
2010
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
116
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We introduce four algorithms for packet transport in complex networks. These algorithms use deterministic rules which depend, in different ways, on the degree of the node...
173
click to vote
HAPTICS
2005
IEEE
15 years 10 months ago
2005
IEEE
This paper describes the implementation of a demo that will be shown at the conference site. The demo of “softfinger grasping of physically based quasi-rigid objects” will pr...