8917 search results - page 365 / 1784 » Abstraction in Algorithm Animation |
164
click to vote
WOLLIC
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We present a domain-independent algorithm for planning that computes macros in a novel way. Our algorithm computes macros “on-the-fly” for a given set of states and ...
156
click to vote
AAECC
2006
Springer
16 years 21 days ago
2006
Springer
Abstract. We consider the problem of determining the period of a binary sequence. For sequences with small autocorrelation we prove the existence of a polynomial time quantum algor...
154
click to vote
AAIM
2006
Springer
16 years 21 days ago
2006
Springer
Abstract. We derive a polynomial time algorithm to compute a stable solution in a mixed matching market from an auction procedure as presented by Eriksson and Karlander [5]. As a s...
171
click to vote
WDAG
2004
Springer
16 years 1 days ago
2004
Springer
Abstract. In this paper, we present fast and fully distributed algorithms for matching in weighted trees and general weighted graphs. The time complexity as well as the approximati...
160
click to vote
GECCO
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. A method of automatic programming, called genetic programming, assumes that the desired program is found by using a genetic algorithm. We propose an idea of ant colony pr...