10051 search results - page 125 / 2011 » A Dynamic Separator Algorithm |
106
click to vote
ALGORITHMICA
2010
15 years 26 days ago
2010
We present the first dynamic graph algorithm for recognizing interval graphs. The algorithm runs in O(n log n) worst-case time per edge deletion or edge insertion, where n is the ...
100
click to vote
CIARP
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. In this paper we introduce a general framework for hierarchical clustering that deals with both static and dynamic data sets. From this framework, different hierarchical...
117
click to vote
JAIR
2008
15 years 22 days ago
2008
Several multiagent reinforcement learning (MARL) algorithms have been proposed to optimize agents' decisions. Due to the complexity of the problem, the majority of the previo...
116
click to vote
JDA
2006
15 years 21 days ago
2006
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
173
Voted
CHINAF
2011
2011
Immigrant schemes for evolutionary algorithms in dynamic environments: Adapting the replacement rate
14 years 4 months ago
One approach for evolutionary algorithms (EAs) to address dynamic optimization problems (DOPs) is to maintain diversity of the population via introducing immigrants. So far all imm...