Sciweavers

1756 search results - page 204 / 352
» Directed scale-free graphs
Sort
View
FOCS
2006
IEEE
14 years 2 months ago
Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
Tamás Király, Lap Chi Lau
CLUSTER
2005
IEEE
14 years 1 months ago
Static scheduling of dependent parallel tasks on heterogeneous clusters
This paper addresses the problem of scheduling parallel tasks, represented by a direct acyclic graph (DAG) on heterogeneous clusters. Parallel tasks, also called malleable tasks, ...
Jorge G. Barbosa, C. N. Morais, R. Nobrega, A. P. ...
ASPLOS
2004
ACM
14 years 1 months ago
Scalable selective re-execution for EDGE architectures
Pipeline flushes are becoming increasingly expensive in modern microprocessors with large instruction windows and deep pipelines. Selective re-execution is a technique that can r...
Rajagopalan Desikan, Simha Sethumadhavan, Doug Bur...
SOFTVIS
2003
ACM
14 years 1 months ago
A New Approach for Visualizing UML Class Diagrams
UML diagrams have become increasingly important in the engineering and reengineering processes for software systems. Of particular interest are UML class diagrams whose purpose is...
Carsten Gutwenger, Michael Jünger, Karsten Kl...
ACSD
1998
IEEE
105views Hardware» more  ACSD 1998»
14 years 18 days ago
Visual Formalisms Revisited
The development of an interactive application is a complex task that has to consider data, behavior, intercommunication, architecture and distribution aspects of the modeled syste...
Radu Grosu, Gheorghe Stefanescu, Manfred Broy