Sciweavers

8917 search results - page 1410 / 1784
» Abstraction in Algorithm Animation
Sort
View
ALT
2001
Springer
16 years 1 months ago
Learning Recursive Functions Refutably
Abstract. Learning of recursive functions refutably means that for every recursive function, the learning machine has either to learn this function or to refute it, i.e., to signal...
Sanjay Jain, Efim B. Kinber, Rolf Wiehagen, Thomas...
ICCAD
2008
IEEE
98views Hardware» more  ICCAD 2008»
16 years 1 months ago
Statistical path selection for at-speed test
Abstract— Process variations make at-speed testing significantly more difficult. They cause subtle delay changes that are distributed rather than the localized nature of a trad...
Vladimir Zolotov, Jinjun Xiong, Hanif Fatemi, Chan...
ICCAD
2008
IEEE
89views Hardware» more  ICCAD 2008»
16 years 1 months ago
Temperature aware task sequencing and voltage scaling
Abstract—On-chip power density and temperature are rising exponentially with decreasing feature sizes. This alarming trend calls for temperature management at every level of syst...
Ramkumar Jayaseelan, Tulika Mitra
102
Voted
ICCAD
2006
IEEE
124views Hardware» more  ICCAD 2006»
16 years 1 months ago
A linear-time approach for static timing analysis covering all process corners
Abstract—Manufacturing process variations lead to circuit timing variability and a corresponding timing yield loss. Traditional corner analysis consists of checking all process c...
Sari Onaissi, Farid N. Najm
132
Voted
ICCAD
2003
IEEE
115views Hardware» more  ICCAD 2003»
16 years 1 months ago
Efficient Verification of Hazard-Freedom in Gate-Level Timed Asynchronous Circuits
This paper presents an efficient method for verifying hazard freedom in timed asynchronous circuits. Timed circuits are a class of asynchronous circuits that utilize explicit tim...
Curtis A. Nelson, Chris J. Myers, Tomohiro Yoneda
« Prev « First page 1410 / 1784 Last » Next »