Optimal substructure

Known as: Optimal-substructure 
In computer science, a problem is said to have optimal substructure if an optimal solution can be constructed efficiently from optimal solutions of… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
We consider the motion-planning problem of planning a collision-free path of a robot in the presence of risk zones. The robot is… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2014
Highly Cited
2014
Quantum spin Hall (QSH) effect materials feature edge states that are topologically protected from backscattering. However, the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2012
2012
The remarkable discovery of many large-scale real networks is the power-law distribution in degree sequence: the number of… (More)
  • table 1
  • figure 1
  • figure 2
Is this relevant?
2011
2011
The earlier the stage where we perform low power design, the higher the dynamic power reduction we achieve. In this paper, we… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2009
Highly Cited
2009
The spatiotemporal patterning of Ca(2+) signals regulates numerous cellular functions, and is determined by the functional… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2004
2004
The cowpea chlorotic mottle virus (CCMV) has a protein cage, or capsid, which encloses its genetic material. The structure of the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Let H be a fixed graph. We introduce the following list homomorphism problem: Given an input graph G and for each vertex v of G a… (More)
Is this relevant?
1996
1996
In this paper, we study the set cover problems, the minimum cardinality key problems and the optimal screen problems. We consider… (More)
  • figure 1
  • table 1
Is this relevant?
Highly Cited
1994
Highly Cited
1994
The ability to identify interesting and repetitive substructures is an essential component to discovering knowledge in structural… (More)
  • figure 8
  • figure 9
  • figure 17
Is this relevant?
Highly Cited
1984
Highly Cited
1984
  • James C. Bezdek, Robert Ehrlich, William E. Full
  • 1984
nThis paper transmits a FORTRAN-IV coding of the fuzzy c-means (FCM) clustering program. The FCM program is applicable to a wide… (More)
  • figure 1
  • table I
  • table 1
  • table 2
  • table 3
Is this relevant?