Sciweavers

1149 search results - page 78 / 230
» Minimally non-Pfaffian graphs
Sort
View
ARSCOM
2006
81views more  ARSCOM 2006»
15 years 6 months ago
A Counting of the minimal realizations of the posets of dimension two
The posets of dimension 2 are those posets whose minimal realizations have two elements, that is, which may be obtained as the intersection of two of their linear extensions. Gall...
Pierre Ille, Jean-Xavier Rampon
ISLPED
1996
ACM
91views Hardware» more  ISLPED 1996»
15 years 10 months ago
Energy minimization using multiple supply voltages
We present a dynamic programming technique for solving the multiple supply voltage scheduling problem in both nonpipelined and functionally pipelined data-paths. The scheduling pro...
Jui-Ming Chang, Massoud Pedram
CLOUDCOM
2009
Springer
15 years 10 months ago
Cost-Minimizing Scheduling of Workflows on a Cloud of Memory Managed Multicore Machines
Workflows are modeled as hierarchically structured directed acyclic graphs in which vertices represent computational tasks, referred to as requests, and edges represent precedent c...
Nicolas G. Grounds, John K. Antonio, Jeffrey T. Mu...
ATS
2004
IEEE
126views Hardware» more  ATS 2004»
15 years 10 months ago
Alternative Run-Length Coding through Scan Chain Reconfiguration for Joint Minimization of Test Data Volume and Power Consumptio
Test data volume and scan power are two major concerns in SoC test. In this paper we present an alternative run-length coding method through scan chain reconfiguration to reduce b...
Youhua Shi, Shinji Kimura, Nozomu Togawa, Masao Ya...
WDAG
2007
Springer
162views Algorithms» more  WDAG 2007»
16 years 9 days ago
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...
Beat Gfeller, Nicola Santoro, Peter Widmayer