Skip to search formSkip to main contentSkip to account menu

Overlapping subproblems

Known as: Overlapping subproblem 
In computer science, a problem is said to have overlapping subproblems if the problem can be broken down into subproblems which are reused several… 
Wikipedia (opens in a new tab)

Related topics

Related topics

6 relations
AlgorithmComputer scienceLongest common subsequence problemMemoization

Broader (1)

Dynamic programming

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
A Comparative Study of Different Longest Common Subsequence Algorithms
The longest common subsequence is a classical problem which is solved by using the dynamic programming approach. The LCS problem… 
2013
2013
THEORETICAL FOUNDATIONS AND EXPERIMENTAL RESULTS FOR A HIERARCHICAL CLASSIFIER WITH OVERLAPPING CLUSTERS
This paper proposes a classification framework based on simple classifiers organized in a tree‐like structure. It is observed… 
2013
2013
Algorithmic Program Synthesis
To solve a problem with a dynamic programming algorithm, one must reformulate the problem such that its solution can be formed… 
2011
2011
CORES: fusion of supervised and unsupervised training methods for a multi-class classification problem
This paper describes in full detail a model of a hierarchical classifier (HC). The original classification problem is broken down… 
2009
2009
A Hierarchical Classifier with Growing Neural Gas Clustering
A novel architecture for a hierarchical classifier (HC) is defined. The objective is to combine several weak classifiers to form… 
2009
2009
Dynamic Programming-based Search Algorithms in NLP
Dynamic Programming (DP) is an important class of algorithms widely used in many areas of speech and language processing. It… 
Review
2005
Review
2005
Dynamic Programming - a Quick Review
Dynamic programming is a class of solution methods for solving sequential decision problems with a compositional cost structure… 
2003
2003
Design and Implementation of the Systolic Array for Dynamic Programming
m µ 35. 0 1-poly 4-metal CMOS technology. I. INTRODUCTION YNAMIC programming [1], a technique for solving combinatorial… 
2002
2002
Minimizing the Average Query Complexity of Learning Monotone Boolean Functions
This paper addresses the problem of completely reconstructing deterministic monotone Boolean functions via membership queries… 
Highly Cited
1998
Highly Cited
1998
Using Dynamic Programming and Overlapping Subproblems to Address Adjacency in Large Harvest Scheduling Problems
The adjacency problem for forest management scheduling is formulated as a dynamic programming problem. To overcome typical… 
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)