Skip to search formSkip to main contentSkip to account menu

Sequential algorithm

Known as: Serial algorithm 
In computer science, a sequential algorithm or serial algorithm is an algorithm that is executed sequentially – once through, from start to finish… 
Wikipedia (opens in a new tab)

Related topics

Related topics

14 relations
AlgorithmBiconnected componentComputer scienceConcurrency control

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
APBT-JPEG Image Coding Based on GPU
In wireless multimedia sensor networks (WMSN), the latency of transmission is an increasingly problem. With the improvement of… 
2014
2014
A Parallel Algorithm for Viewshed Computation on Grid Terrains
Viewshed (or visibility map) computation is an important component in many GIS applications and, as nowadays there are huge… 
2010
2010
Nonparametric Learning in High Dimensions
This thesis develops flexible and principled nonparametric learning algorithms to explore, understand, and predict high… 
Review
2007
Review
2007
An Experiment in Measuring the Productivity of Three Parallel Programming Languages
In May 2005, a 4.5 day long productivity study was performed at the Pittsburgh Supercomputing Center as part of the IBM HPCS… 
2002
2002
Design and implementation of a novel algorithm for general purpose median filtering on FPGAs
We present a novel bit serial algorithm which is scalable and easily implemented on small FPGA chips. The basis of the algorithm… 
2001
2001
Parallelizing Boosting and Bagging Parallelizing Boosting and Arcing
Bagging and boosting are two general techniques for building predictors based on small samples from a dataset. We show that… 
1996
1996
Refined Genetic Algorithms for Polypeptide Structure Prediction.
Abstract : Accurate and reliable prediction of macromolecular structures has eluded researchers for nearly 40 years. Prediction… 
1995
1995
GAP/MPI: Facilitating parallelism
The goal of this work is to overcome the learning barriers faced when first using parallelism. Currently, in order to parallelize… 
1994
1994
Parallelization of an Implicit Runge-Kutta Method for Molecular Dynamics Integration
A parallelized algorithm of an implicit Runge-Kutta integration scheme, the s-stage Gauss-Legendre Runge-Kutta (GLRK) method of… 
1987
1987
The complexity of minimum cut and maximum flow problems in an acyclic network
On montre que trouver une coupe minimum ou un flot maximum dans un reseau acyclique n'est pas plus facile que le meme probleme… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)