Sciweavers

906 search results - page 6 / 182
» Chain Dominated Orders
Sort
View
ORDER
2010
110views more  ORDER 2010»
13 years 5 months ago
The Complexity of Embedding Orders into Small Products of Chains
Embedding a partially ordered set into a product of chains is a classical way to encode it. Such encodings have been used in various fields such as object oriented programming or ...
Olivier Raynaud, Eric Thierry
IWOCA
2010
Springer
219views Algorithms» more  IWOCA 2010»
13 years 2 months ago
Efficient Chaining of Seeds in Ordered Trees
We consider here the problem of chaining seeds in ordered trees. Seeds are mappings between two trees Q and T and a chain is a subset of non overlapping seeds that is consistent wi...
Julien Allali, Cedric Chauve, Pascal Ferraro, Anne...
ISQED
2003
IEEE
71views Hardware» more  ISQED 2003»
14 years 19 days ago
A Proposal for Routing-Based Timing-Driven Scan Chain Ordering
Scan chain insertion can have large impact on routability, wirelength and timing. We propose a routing-driven and timing-aware methodology for scan insertion with minimum wireleng...
Puneet Gupta, Andrew B. Kahng, Stefanus Mantik
VTS
1996
IEEE
111views Hardware» more  VTS 1996»
13 years 11 months ago
Synthesis-for-scan and scan chain ordering
Designing a testable circuit is often a two step process. First, the circuit is designed to conform to the functional specifications. Then, the testability aspects are added. By t...
Robert B. Norwood, Edward J. McCluskey
COMBINATORICS
2006
115views more  COMBINATORICS 2006»
13 years 7 months ago
Chains, Subwords, and Fillings: Strong Equivalence of Three Definitions of the Bruhat Order
Let Sn be the group of permutations of [n] = {1, . . . , n}. The Bruhat order on Sn is a partial order relation, for which there are several equivalent definitions. Three well-kno...
Catalin Zara