12015 search results - page 439 / 2403 » Interactive Algorithms 2005 |
153
click to vote
STACS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We consider the problem of computing a minimum cycle basis in a directed graph G with m arcs and n vertices. The arcs of G have non-negative weights assigned to them. We ...
140
click to vote
WEA
2005
Springer
15 years 10 months ago
2005
Springer
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...
124
click to vote
GD
2003
Springer
15 years 10 months ago
2003
Springer
In this paper we consider the problem of drawing and displaying a series of related graphs, i.e., graphs that share all, or parts of the same node set. We present three algorithms...
168
click to vote
CEC
2005
IEEE
15 years 6 months ago
2005
IEEE
Abstract- Theoretical analysis of the dynamics of evolutionary algorithms is believed to be very important to understand the search behavior of evolutionary algorithms and to devel...
118
click to vote
CEE
2005
15 years 4 months ago
2005
In this paper, we first propose a new continuous action-set learning automaton and theoretically study its convergence properties and show that it converges to the optimal action....