This paper considers two similar graph algorithms that work by repeatedly increasing "flow" along "augmenting paths": the Ford-Fulkerson algorithm for the maxi...
Brian C. Dean, Michel X. Goemans, Nicole Immorlica
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
This paper introduces an ant-based colony system for the representation of a verbal route description. It is grounded on a natural metaphor that mimics the behavior of ant colonie...
Neural networks were evolved through genetic algorithms to focus minimax search in the game of Othello. At each level of the search tree, the focus networks decide which moves are...
A fast algorithm for mesh-based motion estimation employing uniform triangular patches is proposed. The technique utilises an embedded block model to estimate the motion of the me...