Sciweavers

1508 search results - page 166 / 302
» Efficient Path Profiling
Sort
View
FPL
2006
Springer
96views Hardware» more  FPL 2006»
15 years 2 months ago
Reducing the Space Complexity of Pipelined Routing Using Modified Range Encoding
Interconnect delays are becoming an increasingly significant part of the critical path delay for circuits implemented in FPGAs. Pipelined interconnects have been proposed to addre...
Allan Carroll, Carl Ebeling
ECAI
2008
Springer
15 years 1 months ago
Incremental Diagnosis of DES by Satisfiability
Abstract. We propose a SAT-based algorithm for incremental diagnosis of discrete-event systems. The monotonicity is ensured by a prediction window that uses the future observations...
Alban Grastien, Anbulagan
CIIT
2004
111views Communications» more  CIIT 2004»
15 years 18 days ago
Scalable ant-based routing algorithm for ad-hoc networks
Ants-based routing algorithms have attracted the attention of researchers because they are more robust, reliable, and scalable than other conventional routing algorithms. Since th...
Yoshitaka Ohtaki, Naoki Wakamiya, Masayuki Murata,...
FORTE
2004
15 years 18 days ago
Witness and Counterexample Automata for ACTL
Witnesses and counterexamples produced by model checkers provide a very useful source of diagnostic information. They are usually returned in the form of a single computation path ...
Robert Meolic, Alessandro Fantechi, Stefania Gnesi
ISCAPDCS
2004
15 years 18 days ago
Adaptive-Subcube Fault Tolerant Routing in Dual-Cube with Very Large Number of Faulty Nodes
The dual-cube is a newly proposed interconnection network for linking a large amount of nodes with low node degree. It uses low-dimensional hypercubes as building blocks and keeps...
Yamin Li, Shietung Peng, Wanming Chu