Sciweavers

3221 search results - page 535 / 645
» Termination of Linear Programs
Sort
View
VTS
2002
IEEE
126views Hardware» more  VTS 2002»
15 years 11 months ago
On Using Rectangle Packing for SOC Wrapper/TAM Co-Optimization
The testing time for a system-on-chip (SOC) is determined to a large extent by the design of test wrappers and the test access mechanism (TAM). Wrapper/TAM co-optimization is ther...
Vikram Iyengar, Krishnendu Chakrabarty, Erik Jan M...
CPM
2010
Springer
180views Combinatorics» more  CPM 2010»
15 years 11 months ago
Algorithms for Three Versions of the Shortest Common Superstring Problem
Abstract. The input to the Shortest Common Superstring (SCS) problem is a set S of k words of total length n. In the classical version the output is an explicit word SCS(S) in whic...
Maxime Crochemore, Marek Cygan, Costas S. Iliopoul...
SIGSOFT
2009
ACM
15 years 10 months ago
Qos-driven runtime adaptation of service oriented architectures
Runtime adaptation is recognized as a viable way for a serviceoriented system to meet QoS requirements in its volatile operating environment. In this paper we propose a methodolog...
Valeria Cardellini, Emiliano Casalicchio, Vincenzo...
SPAA
2009
ACM
15 years 10 months ago
Brief announcement: a lower bound for depth-restricted work stealing
Work stealing is a common technique used in the runtime schedulers of parallel languages such as Cilk and parallel libraries such as Intel Threading Building Blocks (TBB). Depth-r...
Jim Sukha
FPL
2009
Springer
161views Hardware» more  FPL 2009»
15 years 10 months ago
A multi-FPGA architecture for stochastic Restricted Boltzmann Machines
Although there are many neural network FPGA architectures, there is no framework for designing large, high-performance neural networks suitable for the real world. In this paper, ...
Daniel L. Ly, Paul Chow