Skip to search formSkip to main contentSkip to account menu

Deterministic algorithm

In computer science, a deterministic algorithm is an algorithm which, given a particular input, will always produce the same output, with the… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
This paper presents an analytical model for the study of hybrid ARQ techniques on discrete time Markov channels by means of an… 
2008
2008
A one-dimensional lattice of SIR (susceptible/infected/removed) epidemic centres is considered numerically and analytically. The… 
Highly Cited
2007
Highly Cited
2007
Networks on Chips (NoCs) are required to tackle the increasing delay and poor scalability issues of bus-based communication… 
Highly Cited
2005
Highly Cited
2005
Numerical optimization of given objective functions is a crucial task in many real-life problems. The present article introduces… 
Review
2002
Review
2002
Proper orthogonal decompositions (POD) have been used to define reduced bases for low-dimensional approximations of complex… 
2000
2000
The paper presents one way of reconciling data sparseness with the requirement of high accuracy tagging in terms of fine-grained… 
1999
1999
An effective built-in self-test (BIST) scheme for parallel multipliers (array and tree) is proposed. The new scheme combines the… 
1990
1990
Let Γ be a collection of <italic>n</italic> (possibly intersecting) “red” Jordan arcs of some simple shape in the plane and let… 
1965
1965
WALTER S. STOLZ, PERCY H. TANNENBAUM AND t?I(EDERICK V. CARSTENSEN U~ive'rsity of Wisconsin, Madison, Wisconsin words to be…