Sciweavers

3864 search results - page 71 / 773
» time 2005
Sort
View
167
Voted
MFCS
2005
Springer
15 years 11 months ago
Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
Julia Böttcher
146
Voted
RTCSA
2005
IEEE
15 years 11 months ago
Using UML 2.0 for System Level Design of Real Time SoC Platforms for Stream Processing
While enabling fast implementation and reconfiguration of stream applications, programmable stream processors expose issues of incompatibility and lack of adoption in existing st...
Yongxin Zhu, Zhenxin Sun, Alexander Maxiaguine, We...
ISCAS
2005
IEEE
138views Hardware» more  ISCAS 2005»
15 years 11 months ago
Transition time bounded low-power clock tree construction
— Recently power becomes a significant issue in clock network design for high-performance ICs because the clock network consumes a large portion of the total power in the whole s...
Min Pan, Chris C. N. Chu, J. Morris Chang
ICCAD
2005
IEEE
176views Hardware» more  ICCAD 2005»
16 years 2 months ago
Statistical gate sizing for timing yield optimization
— Variability in the chip design process has been relatively increasing with technology scaling to smaller dimensions. Using worst case analysis for circuit optimization severely...
Debjit Sinha, Narendra V. Shenoy, Hai Zhou
FOSSACS
2005
Springer
15 years 11 months ago
Fault Diagnosis Using Timed Automata
Fault diagnosis consists in observing behaviours of systems, and in detecting online whether an error has occurred or not. In the context of discrete event systems this problem has...
Patricia Bouyer, Fabrice Chevalier, Deepak D'Souza