1736 search results - page 202 / 348 » On antimagic directed graphs |
188
click to vote
STTT
2008
15 years 6 months ago
2008
Explicit model checking algorithms explore the full state space of a system. State spaces are usually treated as directed graphs without any specific features. We gather a large co...
149
click to vote
PC
2000
15 years 6 months ago
2000
Three parallel optimisation algorithms for use in the context of multilevel graph partitioning for unstructured meshes are described. The first, interface optimisation reduces the...
218
click to vote
ISAAC
2010
Springer
15 years 4 months ago
2010
Springer
Howard's policy iteration algorithm is one of the most widely used algorithms for finding optimal policies for controlling Markov Decision Processes (MDPs). When applied to we...
197
click to vote
AI
2011
Springer
15 years 1 months ago
2011
Springer
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
207
click to vote
CGF
2011
14 years 10 months ago
2011
We introduce a fully automatic algorithm which optimizes the high-level structure of a given quadrilateral mesh to achieve a coarser quadrangular base complex. Such a topological ...