3758 search results - page 36 / 752 » A Complete Subsumption Algorithm |
106
Voted
CORR
2010
Springer
15 years 20 days ago
2010
Springer
The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking ...
103
Voted
CORR
2010
Springer
15 years 20 days ago
2010
Springer
Let a, b and n be nonnegative integers (b a, b > 0, n 1), Gn(a, b) be a multigraph on n vertices in which any pair of vertices is connected with at least a and at most b edges ...
86
Voted
TROB
2008
15 years 14 days ago
2008
Abstract--This paper addresses the challenging problem of finding collision-free trajectories for many robots moving toward individual goals within a common environment. Most popul...
96
Voted
COMBINATORICA
2007
15 years 4 days ago
2007
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...
125
click to vote
JSC
2007
15 years 13 days ago
2007
Given a monoid string rewriting system M, one way of obtaining a complete rewriting system for M is to use the classical Knuth-Bendix critical pairs completion algorithm. It is we...