21 search results - page 3 / 5 » isaac 2000 |
ISAAC
2000
Springer
13 years 9 months ago
2000
Springer
We consider online routing algorithms for finding paths between the vertices of plane graphs. We show (1) there exists a routing algorithm for arbitrary triangulations that has no...
ISAAC
2000
Springer
13 years 9 months ago
2000
Springer
Given a set of jobs, each consisting of a number of weighted intervals on the real line, and a number m of machines, we study the problem of selecting a maximum weight subset of th...
ISAAC
2005
Springer
13 years 11 months ago
2005
Springer
Let G be a graph with a nonnegative integral function w defined on V (G). A collection F of subsets of V (G) (repetition is allowed) is called a feedback vertex set packing in G ...
IPPS
2000
IEEE
13 years 10 months ago
2000
IEEE
In this paper we propose a new class of scheduling policies, dubbed Concurrent Gang, that combines the advantages of gang scheduling for communication and synchronization intensiv...
INFOVIS
2000
IEEE
13 years 10 months ago
2000
IEEE
Most work with geospatial data, whether for scientific analysis, urban and environmental planning, or business decision making is carried out by groups. In contrast, geographic vi...