Sciweavers

3958 search results - page 205 / 792
» Dynamic Graph Algorithms with Applications
Sort
View
IPPS
2002
IEEE
15 years 11 months ago
Distributed Dynamic Scheduling of Composite Tasks on Grid Computing Systems
This paper examines the issue of dynamically scheduling applications on a wide-area network computing system. We construct a simulation model for wide-area task allocation problem...
Hongtu Chen, Muthucumaru Maheswaran
ATMOS
2010
134views Optimization» more  ATMOS 2010»
15 years 5 months ago
Vertex Disjoint Paths for Dispatching in Railways
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
Holger Flier, Matús Mihalák, Anita S...
WOSP
1998
ACM
15 years 10 months ago
Poems: end-to-end performance design of large parallel adaptive computational systems
The POEMS project is creating an environment for end-to-end performance modeling of complex parallel and distributed systems, spanning the domains of application software, runti...
Ewa Deelman, Aditya Dube, Adolfy Hoisie, Yong Luo,...
JMLR
2010
194views more  JMLR 2010»
15 years 1 months ago
Graphical Gaussian modelling of multivariate time series with latent variables
In time series analysis, inference about causeeffect relationships among multiple times series is commonly based on the concept of Granger causality, which exploits temporal struc...
Michael Eichler
ASAP
1997
IEEE
155views Hardware» more  ASAP 1997»
15 years 10 months ago
An Approach for Quantitative Analysis of Application-Specific Dataflow Architectures
In this paper we present an approach for quantitative analysis of application-specific dataflow architectures. The approach allows the designer to rate design alternatives in a qu...
Bart Kienhuis, Ed F. Deprettere, Kees A. Vissers, ...