Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
A large number of context-inference applications run on o-the-shelf smart-phones and infer context from the data acquired by… 
2009
2009
Recursive matrix relations for kinematics and dynamics of the Orthoglide parallel robot having three concurrent prismatic… 
2006
2006
This paper presents the performance analysis of several well-known partitioning scheduling algorithms in real-time and fault… 
2004
2004
This paper aims to introduce a time partitioning algorithm which is an important step during the design process for fully… 
2002
2002
  • Gerald Tesauro
  • 2002
  • Corpus ID: 206981540
This paper proposes a principled and practical algorithm for computing optimal strategies in multi-attribute bilateral… 
1996
1996
Many circuit modifications require only a slight adjustment to the IC layouts. General purpose placement algorithms cannot take… 
1995
1995
MESSIAHS is a set of mechanisms supporting task placement in heterogeneous, distributed, autonomous systems. MESSIAHS provides a… 
1990
1990
  • A. Svensson
  • 1990
  • Corpus ID: 9866439
The author proposes a filter component to be included in a load-sharing algorithm to detect short-lived jobs not worth… 
Highly Cited
1989
Highly Cited
1989