Sciweavers

1161 search results - page 119 / 233
» Kinetic Dependence Graphs
Sort
View
92
Voted
ECTEL
2007
Springer
15 years 6 months ago
Adaptation of the ACO Heuristic for Sequencing Learning Activities
This paper describes an initiative aimed at adapting swarm intelligence techniques (in particular, Ant Colony Optimization) to an e-learning environment, thanks to the fact that th...
Sergio Gutiérrez Santos, Grégory Val...
PDP
2003
IEEE
15 years 6 months ago
Scheduling strategies for mixed data and task parallelism on heterogeneous clusters and grids
We consider the execution of a complex application on a heterogeneous "grid" computing platform. The complex application consists of a suite of identical, independent pr...
Olivier Beaumont, Arnaud Legrand, Yves Robert
IPPS
1994
IEEE
15 years 4 months ago
A Comparison of Heuristics for Scheduling DAGs on Multiprocessors
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...
Carolyn McCreary, A. A. Khan, J. J. Thompson, M. E...
104
Voted
APPROX
2008
Springer
119views Algorithms» more  APPROX 2008»
15 years 2 months ago
The Complexity of Distinguishing Markov Random Fields
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
Andrej Bogdanov, Elchanan Mossel, Salil P. Vadhan
CGF
2008
110views more  CGF 2008»
15 years 24 days ago
TimeRadarTrees: Visualizing Dynamic Compound Digraphs
The evolution of dependencies in information hierarchies can be modeled by sequences of compound digraphs with edge weights. In this paper we present a novel approach to visualize...
Michael Burch, Stephan Diehl