Sciweavers

1248 search results - page 89 / 250
» On the Number of Birch Partitions
Sort
View
CIAC
2010
Springer
258views Algorithms» more  CIAC 2010»
14 years 7 months ago
A Planar Linear Arboricity Conjecture
The linear arboricity la(G) of a graph G is the minimum number of linear forests that partition the edges of G. In 1984, Akiyama et al. [1] stated the Linear Arboricity Conjecture...
Marek Cygan, Lukasz Kowalik, Borut Luzar
CCGRID
2006
IEEE
14 years 4 months ago
Transparent Adaptive Library-Based Checkpointing for Master-Worker Style Parallelism
We present a transparent, system-level checkpointing solution for master-worker parallelism that automatically adapts, upon restart, to the number of processor nodes available. Th...
Gene Cooperman, Jason Ansel, Xiaoqin Ma
RSP
2006
IEEE
102views Control Systems» more  RSP 2006»
14 years 4 months ago
Rapid Resource-Constrained Hardware Performance Estimation
In a hardware-software co-design environment, an application is partitioned into modules. Each module is then mapped either to software or to hardware. The mapping process is driv...
Basant Kumar Dwivedi, Arun Kejariwal, M. Balakrish...
EUROPAR
2005
Springer
14 years 3 months ago
Replication Predicates for Dependent-Failure Algorithms
Abstract. To establish lower bounds on the amount of replication, there is a common partition argument used to construct indistinguishable executions such that one violates some pr...
Flavio Paiva Junqueira, Keith Marzullo
ISMVL
2003
IEEE
125views Hardware» more  ISMVL 2003»
14 years 3 months ago
Compact Representations of Logic Functions using Heterogeneous MDDs
In this paper, we propose a compact representation of logic functions using Multi-valued Decision Diagrams (MDDs) called heterogeneous MDDs. In a heterogeneous MDD, each variable ...
Shinobu Nagayama, Tsutomu Sasao