8917 search results - page 184 / 1784 » Abstraction in Algorithm Animation |
131
click to vote
STACS
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. It is well-known that no classical algorithm can solve exactly (i.e., in bounded time without error) the leader election problem in anonymous networks. This paper propose...
126
click to vote
WADS
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Settling a ten years open question, we show that the NPcomplete Feedback Vertex Set problem is deterministically solvable in O(ck ·m) time, where m denotes the number of...
123
click to vote
ACRI
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. This article describes the addition to the von Neumann cellular automaton of the Tom Thumb Algorithm, a mechanism developed for the self-replication of multi-processor sy...
100
click to vote
ARCS
2004
Springer
15 years 8 months ago
2004
Springer
Abstract: We report on our experiences with the implementation of a parallel algorithm to compute the cycle structure of a permutation given as an oracle. As a sub-problem, the cyc...
113
click to vote
GECCO
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. A model of coevolutioinary genetic algorithms (COGA) consisting of two populations coevolving on two-bit landscapes is investigated in terms of the effects of random par...