769 search results - page 117 / 154 » Where Is the Proof |
AAECC
2005
Springer
13 years 9 months ago
2005
Springer
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...
TCS
2008
13 years 9 months ago
2008
The object of this paper is to appreciate the computational limits inherent in the combinatorics of an applied concurrent (aka agent-based) language . That language is primarily m...
TDSC
2008
13 years 9 months ago
2008
Inspired by unidirectional error detecting codes that are used in situations where only one kind of bit error is possible (e.g., it is possible to change a bit "0" into a...
JSCIC
2007
13 years 9 months ago
2007
This paper begins with an overview of the boundary condition capturing approach to solving problems with interfaces. Although, the authors’ original motivation was to extend the...
COMBINATORICS
2004
13 years 9 months ago
2004
A graph G is well-covered if every maximal independent set has the same cardinality. Let sk denote the number of independent sets of cardinality k, and define the independence pol...