803 search results - page 112 / 161 » Independence in Direct-Product Graphs |
ASPDAC
2006
ACM
14 years 2 months ago
2006
ACM
- Reducing the yield loss due to via failure is one of the important problems in design for manufacturability. A well known and highly recommended method to improve via yield/relia...
ACSD
2005
IEEE
14 years 2 months ago
2005
IEEE
Asynchronous data communication mechanisms (ACMs) have been extensively studied as data connectors between independently timed processes in digital systems. In previous work, syst...
ICDCS
2003
IEEE
14 years 1 months ago
2003
IEEE
We introduce the hash history mechanism for capturing dependencies among distributed replicas. Hash histories, consisting of a directed graph of version hashes, are independent of...
COCOON
2000
Springer
14 years 26 days ago
2000
Springer
We consider the parameterized complexity of the following problem under the framework introduced by Downey and Fellows[4]: Given a graph G, an integer parameter k and a non-trivial...
IPPS
1998
IEEE
14 years 23 days ago
1998
IEEE
The scheduling of application tasks is a problem that occurs in all multiprocessor systems. This problem becomes even more complicated if the tasks are not independent but are inte...