10051 search results - page 122 / 2011 » A Dynamic Separator Algorithm |
158
click to vote
APPT
2007
Springer
15 years 6 months ago
2007
Springer
Dynamic programming is a widely applied algorithm design technique in many areas such as computational biology and scientific computing. Typical applications using this technique a...
129
click to vote
SWAT
1994
Springer
15 years 8 months ago
1994
Springer
We study the complexity of the dynamic partial sum problem in the cell-probe model. We give the model access to nondeterministic queries and prove that the problem remains hard. We...
129
click to vote
EVOW
2006
Springer
15 years 8 months ago
2006
Springer
In recent years dynamic optimization problems have attracted a growing interest from the community of genetic algorithms with several approaches developed to address these problems...
123
click to vote
WEA
2009
Springer
15 years 11 months ago
2009
Springer
A dynamic shortest-path algorithm is called a batch algorithm if it is able to handle graph changes that consist of multiple edge updates at a time. In this paper we focus on fully...
141
click to vote
CSMR
2005
IEEE
15 years 10 months ago
2005
IEEE
Impact analysis is the process of determining the effect, or impact, of a change to a software system. Dynamic impact analysis uses data obtained from executing a program to perfo...