Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,779,161 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
12 relations
Closest pair of points problem
Computational complexity theory
Computational geometry
Dynamic connectivity
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Energy-Accuracy Trade-offs in Querying Sensor Data for Continuous Sensing Mobile Systems
K. Rachuri
,
Mirco Musolesi
,
C. Mascolo
2010
Corpus ID: 2799469
A large number of context-inference applications run on o-the-shelf smart-phones and infer context from the data acquired by…
Expand
2009
2009
Dynamics of the Orthoglide parallel robot
D. Chablat
,
P. Wenger
,
S. Staicu
arXiv.org
2009
Corpus ID: 10319027
Recursive matrix relations for kinematics and dynamics of the Orthoglide parallel robot having three concurrent prismatic…
Expand
2006
2006
Fault-Tolerant Partitioning Scheduling Algorithms in Real-Time Multiprocessor Systems
Hakem Beitollahi
,
Geert Deconinck
Pacific Rim International Symposium on Dependable…
2006
Corpus ID: 15142576
This paper presents the performance analysis of several well-known partitioning scheduling algorithms in real-time and fault…
Expand
2004
2004
Synthesis and Time Partitioning for Reconfigurable Systems
B. Ouni
,
A. Mtibaa
,
M. Abid
Design automation for embedded systems
2004
Corpus ID: 11959127
This paper aims to introduce a time partitioning algorithm which is an important step during the design process for fully…
Expand
2002
2002
Efficient search techniques for multi-attribute bilateral negotiation strategies
Gerald Tesauro
Proceedings. Third International Symposium on…
2002
Corpus ID: 206981540
This paper proposes a principled and practical algorithm for computing optimal strategies in multi-attribute bilateral…
Expand
1996
1996
Incremental layout placement modification algorithms
O. Choy
,
Tsz-Shing Cheung
,
Kam-Keung Wong
IEEE Trans. Comput. Aided Des. Integr. Circuits…
1996
Corpus ID: 28378224
Many circuit modifications require only a slight adjustment to the IC layouts. General purpose placement algorithms cannot take…
Expand
1995
1995
Distributed Scheduling Support in the Presence of Autonomy
S. Chapin
1995
Corpus ID: 15221393
MESSIAHS is a set of mechanisms supporting task placement in heterogeneous, distributed, autonomous systems. MESSIAHS provides a…
Expand
1994
1994
Incremental Algorithms for Collision Detection Between General Solid Models
M. K. Ponamgi
,
Dinesh Manocha
,
Ming C Lin
1994
Corpus ID: 116932847
1990
1990
History, an intelligent load sharing filter
A. Svensson
Proceedings.,10th International Conference on…
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…
Expand
Highly Cited
1989
Highly Cited
1989
OSPF specification
Request for Comments
1989
Corpus ID: 37772689
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)
ACCEPT & CONTINUE