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

Decision problem

Known as: Solvable, Decision variant, Decidability problems 
In computability theory and computational complexity theory, a decision problem is a question in some formal system with a yes-or-no answer… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2019
Review
2019
  • D. Bertsekas
  • IEEE/CAA Journal of Automatica Sinica
  • 2019
  • Corpus ID: 4881243
In this paper we discuss policy iteration methods for approximate solution of a finite-state discounted Markov decision problem… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Review
2019
Review
2019
This is a pedagogical review on $\mathrm{T}\overline{\mathrm{T}}$ deformation of two dimensional quantum field theories. It is… Expand
Review
2018
Review
2018
Plastic pollution has become the new millennium's tragedy of the commons. This is particularly true with the marine debris… Expand
Review
2018
Review
2018
Designing Green Supply Chains (GSCs) requires complex decision-support models that can deal with multiple dimensions of… Expand
Review
2017
Review
2017
In an increasingly networked world in which information is becoming increasingly actual, how can a system know with certainty… Expand
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • figure 3.1
  • figure 3.2
Highly Cited
2001
Highly Cited
2001
  • F. Jensen
  • Statistics for Engineering and Information…
  • 2001
  • Corpus ID: 42979791
Probabilistic graphical models and decision graphs are powerful modeling tools for reasoning and decision making under… Expand
  • figure 1.1
  • figure 1.2
  • figure 1.3
Highly Cited
2000
Highly Cited
2000
A study on the steps to follow in linguistic decision analysis is presented in a context of multi-criteria/multi-person decision… Expand
  • figure 1
  • figure 2
  • figure 5
  • figure 4
Highly Cited
1993
Highly Cited
1993
1. Introduction: The Classical Decision Problem.- 1.1 The Original Problem.- 1.2 The Transformation of the Classical Decision… Expand
Highly Cited
1959
Highly Cited
1959
Finite automata are considered in this paper as instruments for classifying finite tapes. Each one-tape automaton defines a set… Expand
Highly Cited
1953
Highly Cited
1953
1. Introduction. In this paper we consider classes whose elements are re-cursively enumerable sets of non-negative integers. No… Expand