Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,217,199 papers from all fields of science
Search
Sign In
Create Free Account
Deterministic algorithm
In computer science, a deterministic algorithm is an algorithm which, given a particular input, will always produce the same output, with the…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
AKS primality test
Aanderaa–Karp–Rosenberg conjecture
Abstract machine
Adleman–Pomerance–Rumely primality test
Expand
Broader (1)
Analysis of algorithms
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
High-efficiency multiphoton boson sampling
Hui Wang
,
Yu-Ming He
,
+15 authors
Jian-Wei Pan
Nature Photonics
2017
Corpus ID: 55541188
Boson sampling is considered as a strong candidate to demonstrate ‘quantum computational supremacy’ over classical computers…
Expand
Review
2014
Review
2014
Clustering in sensor networks: A literature survey
M. M. Afsar
,
Mohammad-H. Tayarani-N.
Journal of Network and Computer Applications
2014
Corpus ID: 14119929
Review
2008
Review
2008
Global Value Chains and Technological Capabilities: A Framework to Study Learning and Innovation in Developing Countries
A. Morrison
,
C. Pietrobelli
,
Roberta Rabellotti
2008
Corpus ID: 11453643
This paper presents a critical review of the global value chain (GVC) literature in light of the “technological capabilities…
Expand
Highly Cited
2008
Highly Cited
2008
OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions
M. Abramson
,
Charles Audet
,
J. Dennis
,
Sébastien Le Digabel
SIAM Journal on Optimization
2008
Corpus ID: 12739979
The purpose of this paper is to introduce a new way of choosing directions for the mesh adaptive direct search (Mads) class of…
Expand
Highly Cited
2007
Highly Cited
2007
Simple deterministic approximation algorithms for counting matchings
M. Bayati
,
D. Gamarnik
,
D. A. Katz
,
Chandra Nair
,
P. Tetali
Symposium on the Theory of Computing
2007
Corpus ID: 2284767
We construct a deterministic fully polynomial time approximationscheme (FPTAS) for computing the total number of matchings in…
Expand
Highly Cited
2005
Highly Cited
2005
Structural breaks with deterministic and stochastic trends
Pierre Perron
,
Xiaokang Zhu
2005
Corpus ID: 55873915
Highly Cited
2002
Highly Cited
2002
Optimal synthesis of mechanisms with genetic algorithms
J. A. Cabrera
,
A. Simón
,
M. Prado
2002
Corpus ID: 29617906
Highly Cited
2002
Highly Cited
2002
Optimal transmitter eigen-beamforming and space time block coding based on channel mean
Shengli Zhou
,
G. Giannakis
IEEE International Conference on Acoustics…
2002
Corpus ID: 3169384
Optimal transmitter designs obeying the water-filling principle are well-documented, and widely applied when the propagation…
Expand
Highly Cited
2002
Highly Cited
2002
Japanese Dependency Analysis using Cascaded Chunking
Taku Kudo
,
Yuji Matsumoto
Conference on Computational Natural Language…
2002
Corpus ID: 9404516
In this paper, we propose a new statistical Japanese dependency parser using a cascaded chunking model. Conventional Japanese…
Expand
Highly Cited
1995
Highly Cited
1995
Moment-preserving thresholding: a new approach
Wen-Hsiang Tsai
1995
Corpus ID: 59659267
A new approach to automatic threshold selection using the moment-preserving principle is proposed. The threshold values are…
Expand
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)
ACCEPT & CONTINUE