2745 search results - page 285 / 549 » A fast algorithm for computing large Fibonacci numbers |
154
click to vote
DAC
2010
ACM
15 years 8 months ago
2010
ACM
Fault simulation is essential in test generation, design for test and reliability assessment of integrated circuits. Reliability analysis and the simulation of self-test structure...
130
click to vote
ICALP
2003
Springer
15 years 10 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
143
click to vote
APPT
2003
Springer
15 years 10 months ago
2003
Springer
Increase in amount of data stored and requirement of fast response time has motivated the research in Parallel Database Systems (PDS). Requirement for correctness of data still rem...
138
Voted
CCE
2004
15 years 4 months ago
2004
This work focuses on the basic stochastic decomposition (SD) algorithm of Higle and Sen [J.L. Higle, S. Sen, Stochastic Decomposition, Kluwer Academic Publishers, 1996] for two-st...
150
click to vote
ALGOSENSORS
2007
Springer
15 years 11 months ago
2007
Springer
e for abstract modeling, algorithmic design and analysis to achieve provably efficient, scalable and fault-tolerant realizations of such huge, highly-dynamic, complex, non-conventi...