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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2015

Skip Graph, as a distributed hash table (DHT) based data structure, plays a key role in peer-to-peer (P2P) storage systems…

2011

Geographic Information Retrieval (GIR) is a specialized branch of traditional Information Retrieval (IR), which deals with the…

2010

A large number of context-inference applications run on o-the-shelf smart-phones and infer context from the data acquired by…

2009

Recursive matrix relations for kinematics and dynamics of the Orthoglide parallel robot having three concurrent prismatic…

2006

This paper presents the performance analysis of several well-known partitioning scheduling algorithms in real-time and fault…

2004

This paper aims to introduce a time partitioning algorithm which is an important step during the design process for fully…

1996

Many circuit modifications require only a slight adjustment to the IC layouts. General purpose placement algorithms cannot take…

1994

1992

According to the present method of positioning a semiconductor member by examining it, an optical image of the semiconductor…

1990

The author proposes a filter component to be included in a load-sharing algorithm to detect short-lived jobs not worth…