Sciweavers

8298 search results - page 152 / 1660
» On the Complexity of Numerical Analysis
Sort
View
SAS
1991
Springer
15 years 10 months ago
Polymorphic Time Systems for Estimating Program Complexity
We present a new approach to static program analysis that permits each expression in a program to be assigned an execution time estimate. Our approach uses a time system in conjun...
Vincent Dornic, Pierre Jouvelot, David K. Gifford
BC
2008
89views more  BC 2008»
15 years 6 months ago
Complex evolution of spike patterns during burst propagation through feed-forward networks
Abstract Stable signal transmission is crucial for information processing by the brain. Synfire-chains, defined as feedforward networks of spiking neurons, are a well-studied class...
Jun-nosuke Teramae, Tomoki Fukai
FASE
2009
Springer
16 years 1 months ago
Scalable Analysis of Scalable Systems
Abstract. We present a systematic method of analysing the scalability of large-scale systems. We construct a high-level model using the SRMC process calculus and generate variants ...
Allan Clark, Stephen Gilmore, Mirco Tribastone
ASPLOS
1996
ACM
15 years 10 months ago
A Quantitative Analysis of Loop Nest Locality
This paper analyzes and quantifies the locality characteristics of numerical loop nests in order to suggest future directions for architecture and software cache optimizations. Si...
Kathryn S. McKinley, Olivier Temam
RTA
2010
Springer
15 years 9 months ago
Automated Termination Analysis of Java Bytecode by Term Rewriting
We present an automated approach to prove termination of Java Bytecode (JBC) programs by automatically transforming them to term rewrite systems (TRSs). In this way, the numerous t...
Carsten Otto, Marc Brockschmidt, Christian von Ess...