Sciweavers

106 search results - page 17 / 22
» Light Logics and Optimal Reduction: Completeness and Complex...
Sort
View
GLVLSI
2009
IEEE
122views VLSI» more  GLVLSI 2009»
14 years 2 months ago
Enhancing SAT-based sequential depth computation by pruning search space
The sequential depth determines the completeness of bounded model checking in design verification. Recently, a SATbased method is proposed to compute the sequential depth of a de...
Yung-Chih Chen, Chun-Yao Wang
IROS
2007
IEEE
97views Robotics» more  IROS 2007»
14 years 1 months ago
Meld: A declarative approach to programming ensembles
Abstract— This paper presents Meld, a programming language for modular robots, i.e., for independently executing robots where inter-robot communication is limited to immediate ne...
Michael P. Ashley-Rollman, Seth Copen Goldstein, P...
JACM
2006
98views more  JACM 2006»
13 years 7 months ago
Distribution sort with randomized cycling
Parallel independent disks can enhance the performance of external memory (EM) algorithms, but the programming task is often di cult. In this paper we develop randomized variants ...
Jeffrey Scott Vitter, David A. Hutchinson
SAMOS
2004
Springer
14 years 22 days ago
A Novel Data-Path for Accelerating DSP Kernels
A high-performance data-path to implement DSP kernels is proposed in this paper. The data-path is based on a flexible, universal, and regular component to optimally exploiting both...
Michalis D. Galanis, George Theodoridis, Spyros Tr...
DATE
2008
IEEE
145views Hardware» more  DATE 2008»
14 years 1 months ago
Minimizing Virtual Channel Buffer for Routers in On-chip Communication Architectures
We present a novel methodology for design space exploration using a two-steps scheme to optimize the number of virtual channel buffers (buffers take the premier share of the route...
Mohammad Abdullah Al Faruque, Jörg Henkel