87 search results - page 15 / 18 » Elements of Argumentation |
SFP
2001
15 years 10 days ago
2001
: We study type checking that is complete in the sense that it accepts every program whose subexpressions can all be executed without raising a type error at runtime. In a complete...
MP
2002
14 years 10 months ago
2002
In this paper we describe an automatic procedure for successively reducing the set of possible nonzeros in a Jacobian matrix until eventually the exact sparsity pattern is obtained...
105
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
A sequence is nonrepetitive if it does not contain two adjacent identical blocks. The remarkable construction of Thue asserts that 3 symbols are enough to build an arbitrarily long...
TLT
2010
14 years 5 months ago
2010
Evidence from a range of studies indicates the potential that mobile technologies have to support important aspects of learning. However, it is clear from a number of study finding...
ICALP
2009
Springer
15 years 11 months ago
2009
Springer
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...