Skip to search formSkip to main contentSkip to account menu

Run time (program lifecycle phase)

Known as: Runtime error, Run time, Runtime performance 
In computer science, run time, runtime or execution time is the time during which a program is running (executing), in contrast to other program… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
Abstraction (software engineering)Actifed (computer virus)Akra–Bazzi methodAlgorithmic learning theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Joint Feature Selection in Distributed Stochastic Learning for Large-Scale Discriminative Training in SMT
With a few exceptions, discriminative training in statistical machine translation (SMT) has been content with tuning weights for… 
Highly Cited
2011
Highly Cited
2011
Energy-Efficient Multicasting of Scalable Video Streams Over WiMAX Networks
The Multicast/Broadcast Service (MBS) feature of mobile WiMAX network is a promising technology for providing wireless multimedia… 
2009
2009
Dynamic parallelization of single-threaded binary programs using speculative slicing
The performance of single-threaded programs and legacy binary code is of critical importance in many everyday applications… 
2008
2008
Improved Approximate Detection of Duplicates for Data Streams Over Sliding Windows
Detecting duplicates in data streams is an important problem that has a wide range of applications. In general, precisely… 
2007
2007
Sub-Image Detection Using Fast Neural Processors and Image Decomposition
⎯ In this paper, an approach to reduce the computation steps required by fast neural networks for the searching process is… 
Highly Cited
1995
Highly Cited
1995
Efficient estimation of arc criticalities in stochastic activity networks
An algorithm is described for estimating arc and path criticalities in stochastic activity networks by combining Monte Carlo… 
Highly Cited
1994
Highly Cited
1994
A Decomposition Algorithm for the All-Pairs Shortest Path Problem on Massively Parallel Computer Architectures
The shortest path problem is a classical and important combinatorial problem with many applications. We examine the solution of… 
Review
1993
Review
1993
Overview of the CHIP Compiler System
The MIPSpro compiler system consists of a set of components that enable you to create new 32-bit and 64-bit executable programs… 
1990
1990
On optimum and suboptimum biasing procedures for importance sampling in communication simulation
Importance sampling can significantly reduce simulation run time in estimating the bit error probability of digital systems if a… 
1987
1987
An Approach to Parallel Processing of Dynamic Robot Models
A new parallel-processing scheme for robot dynamics compu tation on a multiprocessor system is described. The model to be…