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

Dynamic problem (algorithms)

Known as: Dynamic Algorithms, Dynamic algorithm, Dynamic problem 
Dynamic problems in computational complexity theory are problems stated in terms of the changing input data. In the most general form a problem in… Expand
Wikipedia

Related topics

Related topics

12 relations
Closest pair of points problemComputational complexity theoryComputational geometryDynamic connectivity
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
A new dynamic approach for statistical optimization of GNSS radio occultation bending angles for optimal climate monitoring utility
[1] Global Navigation Satellite System (GNSS)-based radio occultation (RO) is a satellite remote sensing technique providing… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2010
Highly Cited
2010
On Dynamic Shortest Paths Problems
We obtain the following results related to dynamic versions of the shortest-paths problem: (i)Reductions that show that the… Expand
  • figure 1
  • figure 2
  • figure 4
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Incremental Learning for Robust Visual Tracking
Abstract Visual tracking, in essence, deals with non-stationary image streams that change over time. While most existing… Expand
  • figure 2
  • figure 4
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Experimental study on population-based incremental learning algorithms for dynamic optimization problems
Evolutionary algorithms have been widely used for stationary optimization problems. However, the environments of real world… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • table 1
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Scaling personalized web search
Recent web search techniques augment traditional text matching with a global notion of "importance" based on the linkage… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Image-based visual hulls
In this paper, we describe an efficient image-based approach to computing and shading visual hulls from silhouette image data… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Randomized fully dynamic graph algorithms with polylogarithmic time per operation
This paper solves a longstanding open problem in fully dynamic algorithms: We present the first fully dynamic algorithms that… Expand
Is this relevant?
Highly Cited
1996
Highly Cited
1996
On the Computational Complexity of Dynamic Graph Problems
Abstract A common way to evaluate the time complexity of an algorithm is to use asymptotic worst-case analysis and to express the… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1993
Highly Cited
1993
A Unified Model of Investment Under Uncertainty
This paper extends the theory of investment under uncertainty to incorporate fixed costs of investment, a wedge between the… Expand
Is this relevant?
Highly Cited
1992
Highly Cited
1992
INTERNAL DEFORMATION DUE TO SHEAR AND TENSILE FAULTS IN A HALF-SPACE
A complete set of closed analytical expressions is presented in a unified manner for the internal displacements and strains due… Expand
  • figure 1
  • figure 2
  • table 3
  • figure 3
  • figure 4
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE