Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2018
Review
2018
Abstract The bandwidth of the communication networks has been increased continuously as results of technological advances… Expand
Review
2017
Review
2017
ABSTRACT This paper describes the use of a drone in collecting data for mapping discontinuities within a marble quarry. A… Expand
Highly Cited
2011
Highly Cited
2011
Cellular networks are usually modeled by placing the base stations on a grid, with mobile users either randomly scattered or… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2006
Highly Cited
2006
The existence of polynomial time algorithms for the solution of parity games is a major open problem. The fastest known… Expand
  • figure 1
  • figure 2
Highly Cited
2005
Highly Cited
2005
Under a revenue-sharing contract, a retailer pays a supplier a wholesale price for each unit purchased, plus a percentage of the… Expand
  • figure 1
  • figure 2
  • figure 3
Highly Cited
1999
Highly Cited
1999
  • M. Clerc
  • Proceedings of the Congress on Evolutionary…
  • 1999
  • Corpus ID: 119835760
A very simple particle swarm optimization iterative algorithm is presented, with just one equation and one social/confidence… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • table 1
Highly Cited
1993
Highly Cited
1993
We present an algorithm for finding the global maximum of a multimodal, multivariate function for which derivatives are available… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Highly Cited
1992
Highly Cited
1992
We describe a deterministic version of a 1990 Cheriyan, Hagerup, and Mehlhorn randomized algorithm for computing the maximum flow… Expand
Highly Cited
1988
Highly Cited
1988
An efficient deterministic polynomial time algorithm is developed for the sparse polynomial interpolation problem. The number of… Expand
  • figure I
Highly Cited
1971
Highly Cited
1971
  • S. Cook
  • STOC '71
  • 1971
  • Corpus ID: 7573663
It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to… Expand