2270 search results - page 242 / 454 » On the distribution of eigenvalues of graphs |
181
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
163
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
This work deals with the scheduling problem of a directed acyclic graph with interprocessor communication delays. The objective is to minimize the makespan, taking into account the...
154
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
This paper presents our work on the static task scheduling model using the mean-field annealing (MFA) technique. Mean-field annealing is a technique of thermostatic annealing that...
169
click to vote
GD
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. Techniques for drawing graphs based on force-directed placement and virtual physical models have proven surprisingly successful in producing good layouts of undirected gr...
151
click to vote
IPPS
1994
IEEE
15 years 10 months ago
1994
IEEE
Many algorithms to schedule DAGs on multiprocessors have been proposed, but there has been little work done to determine their effectiveness. Since multi-processor scheduling is a...