Sciweavers

8298 search results - page 20 / 1660
» On the Complexity of Numerical Analysis
Sort
View
CDC
2008
IEEE
228views Control Systems» more  CDC 2008»
15 years 4 months ago
Stability analysis for neural networks with time-varying delay
— This paper studies the problem of stability analysis for neural networks (NNs) with a time-varying delay. The activation functions are assumed to be neither monotonic, nor diff...
Xun-Lin Zhu, Guang-Hong Yang
ISSTA
2006
ACM
15 years 3 months ago
Using model checking with symbolic execution to verify parallel numerical programs
We present a method to verify the correctness of parallel programs that perform complex numerical computations, including computations involving floating-point arithmetic. The me...
Stephen F. Siegel, Anastasia Mironova, George S. A...
MOC
2011
14 years 4 months ago
Fast evaluation of modular functions using Newton iterations and the AGM
We present an asymptotically fast algorithm for the numerical evaluation of modular functions such as the elliptic modular function j. Our algorithm makes use of the natural connec...
Régis Dupont
DEEC
2006
IEEE
15 years 1 months ago
A Bottom-Up Workflow Mining Approach for Workflow Applications Analysis
Abstract. Engineering workflow applications are becoming more and more complex, involving numerous interacting business objects within considerable processes. Analysing the interac...
Walid Gaaloul, Karim Baïna, Claude Godart
TOPLAS
2002
89views more  TOPLAS 2002»
14 years 9 months ago
Efficient and precise array access analysis
A number of existing compiler techniques hinge on the analysis of array accesses in the program. The most important task in array access analysis is to collect the information abo...
Yunheung Paek, Jay Hoeflinger, David A. Padua