Sciweavers

212 search results - page 15 / 43
» On Lengths of Rainbow Cycles
Sort
View
DM
2007
57views more  DM 2007»
13 years 9 months ago
Triangulated neighborhoods in even-hole-free graphs
An even-hole-free graph is a graph that does not contain, as an induced subgraph, a chordless cycle of even length. A graph is triangulated if it does not contain any chordless cy...
Murilo Vicente Gonçalves da Silva, Kristina...
ENTCS
2006
99views more  ENTCS 2006»
13 years 9 months ago
Termination Criteria for Bounded Model Checking: Extensions and Comparison
Increasing attention has been paid recently to criteria that allow one to conclude that a structure models a linear-time property from the knowledge that no counterexamples exist ...
Mohammad Awedh, Fabio Somenzi
ASPDAC
2006
ACM
230views Hardware» more  ASPDAC 2006»
14 years 3 months ago
Statistical Bellman-Ford algorithm with an application to retiming
— Process variations in digital circuits make sequential circuit timing validation an extremely challenging task. In this paper, a Statistical Bellman-Ford (SBF) algorithm is pro...
Mongkol Ekpanyapong, Thaisiri Watewai, Sung Kyu Li...
TPDS
2008
199views more  TPDS 2008»
13 years 9 months ago
DCMP: A Distributed Cycle Minimization Protocol for Peer-to-Peer Networks
Abstract-- Broadcast-based Peer-to-Peer (P2P) networks, including flat (e.g., Gnutella) and two-layer super-peer implementations (e.g., Kazaa), are extremely popular nowadays due t...
Zhenzhou Zhu, Panos Kalnis, Spiridon Bakiras
ASPDAC
2007
ACM
89views Hardware» more  ASPDAC 2007»
14 years 1 months ago
Trace Compaction using SAT-based Reachability Analysis
In today's designs, when functional verification fails, engineers perform debugging using the provided error traces. Reducing the length of error traces can help the debugging...
Sean Safarpour, Andreas G. Veneris, Hratch Mangass...