Sciweavers

1425 search results - page 115 / 285
» Beyond Dependency Graphs
Sort
View
ICCAD
1999
IEEE
119views Hardware» more  ICCAD 1999»
14 years 15 days ago
Factoring logic functions using graph partitioning
Algorithmic logic synthesis is usually carried out in two stages, the independent stage where logic minimization is performed on the Boolean equations with no regard to physical p...
Martin Charles Golumbic, Aviad Mintz
HIPEAC
2009
Springer
14 years 2 days ago
HeDGE: Hybrid Dataflow Graph Execution in the Issue Logic
Abstract. Exposing more instruction-level parallelism in out-of-order superscalar processors requires increasing the number of dynamic in-flight instructions. However, large instru...
Suriya Subramanian, Kathryn S. McKinley
CN
2008
126views more  CN 2008»
13 years 8 months ago
Graph transformation approaches for diverse routing in shared risk resource group (SRRG) failures
Failure resilience is a desired feature of the Internet. Most traditional restoration architectures assume single-failure assumption, which is not adequate in present day WDM opti...
Pallab Datta, Arun K. Somani
DM
2008
112views more  DM 2008»
13 years 8 months ago
Orbit-counting polynomials for graphs and codes
We construct an "orbital Tutte polynomial" associated with a dual pair M and M of matrices over a principal ideal domain R and a group G of automorphisms of the row spac...
Peter J. Cameron, Bill Jackson, Jason D. Rudd
NETWORKS
2002
13 years 7 months ago
Superconnected digraphs and graphs with small conditional diameters
The conditional diameter D of a digraph G measures how far apart a pair of vertex sets V1 and V2 can be in such a way that the minimum out-degree and the minimum in-degree of the ...
Camino Balbuena, Josep Fàbrega, Xavier Marc...