Sciweavers

8093 search results - page 422 / 1619
» Design optimization
Sort
View
ESA
2008
Springer
115views Algorithms» more  ESA 2008»
15 years 8 months ago
Deterministic Sampling Algorithms for Network Design
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
Anke van Zuylen
ICCAD
2009
IEEE
93views Hardware» more  ICCAD 2009»
15 years 4 months ago
An efficient wakeup scheduling considering resource constraint for sensor-based power gating designs
Power gating has been a very effective way to reduce leakage power. One important design issue for a power gating design is to limit the surge current during the wakeup process. N...
Ming-Chao Lee, Yu-Ting Chen, Yo-Tzu Cheng, Shih-Ch...
CHI
2008
ACM
16 years 7 months ago
AutoCardSorter: designing the information architecture of a web site using latent semantic analysis
In this paper, we describe an innovative tool that supports the design and evaluation of the information architecture of a Web site. The tool uses Latent Semantic Analysis and hie...
Christos Katsanos, Nikolaos K. Tselios, Nikolaos M...
IOLTS
2009
IEEE
231views Hardware» more  IOLTS 2009»
16 years 1 months ago
Designing fault tolerant FSM by nano-PLA
— The paper deals with designing fault tolerant finite state machines (FSMs) by nanoelectronic programmable logic arrays (PLAs). Two main critical parameters of the fault toleran...
Samary Baranov, Ilya Levin, Osnat Keren, Mark G. K...
IPPS
2009
IEEE
16 years 1 months ago
Design, implementation, and evaluation of transparent pNFS on Lustre
Parallel NFS (pNFS) is an emergent open standard for parallelizing data transfer over a variety of I/O protocols. Prototypes of pNFS are actively being developed by industry and a...
Weikuan Yu, Oleg Drokin, Jeffrey S. Vetter