Sciweavers

7200 search results - page 1198 / 1440
» On the Computational Power of Winner-Take-All
Sort
View
ACRI
2010
Springer
14 years 10 days ago
Network Decontamination with Temporal Immunity by Cellular Automata
Abstract. Network decontamination (or disinfection) is a widely studied problem in distributed computing. Network sites are assumed to be contaminated (e.g., by a virus) and a team...
Yassine Daadaa, Paola Flocchini, Nejib Zaguia
FPGA
2008
ACM
163views FPGA» more  FPGA 2008»
14 years 9 days ago
TORCH: a design tool for routing channel segmentation in FPGAs
A design tool for routing channel segmentation in islandstyle FPGAs is presented. Given the FPGA architecture parameters and a set of benchmark designs, the tool optimizes routing...
Mingjie Lin, Abbas El Gamal
ISLPED
2007
ACM
96views Hardware» more  ISLPED 2007»
14 years 9 days ago
Low-power process-variation tolerant arithmetic units using input-based elastic clocking
In this paper we propose a design methodology for low-power, high-performance, process-variation tolerant architecture for arithmetic units. The novelty of our approach lies in th...
Debabrata Mohapatra, Georgios Karakonstantis, Kaus...
ASAP
2010
IEEE
143views Hardware» more  ASAP 2010»
14 years 9 days ago
Loop transformations for interface-based hierarchies IN SDF graphs
Data-flow has proven to be an attractive computation model for programming digital signal processing (DSP) applications. A restricted version of data-flow, termed synchronous data...
Jonathan Piat, Shuvra S. Bhattacharyya, Mickaë...
AAAI
2010
14 years 7 days ago
Dealing with Infinite Loops, Underestimation, and Overestimation of Depth-First Proof-Number Search
Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. However, df-pn has a notorious problem of infinite loops when applied to domain...
Akihiro Kishimoto
« Prev « First page 1198 / 1440 Last » Next »