PRF Domain Extension using DAGs Charanjit Jutla IBM T J Watson.
Tecniche di Apprendimento Automatico Evelina Lamma Fabrizio Riguzzi Sergio Storari Giacomo Gamberoni.
Parallel Algorithms
Graph Algorithms: Topological Sort The topological sorting problem: given a directed, acyclic graph G = (V, E), find a linear ordering of the vertices.
Precedence Constrained Scheduling Abhiram Ranade Dept. of CSE IIT Bombay.
CS 440 / ECE 448 Introduction to Artificial Intelligence Spring 2010 Instructor: Eyal Amir Grad TAs: Wen Pu, Yonatan Bisk Undergrad TAs: Sam Johnson, Nikhil.
Multithreaded Algorithms Andreas Klappenecker. Motivation We have discussed serial algorithms that are suitable for running on a uniprocessor computer.
A Graph Transformation System Model of Reliable Dynamic Communication Networks for Location Transparent Mobile Agents M. Kurihara (Hokkaido Univ., Japan)
Graph Algorithms: Topological Sort