777 search results - page 23 / 156 » A fast algorithm for the computation of an upper bound on th... |
SOFTWARE
2002
13 years 7 months ago
2002
Abstract. This paper presents a new approximation method for computing arguments or explanations in the context of logic-based argumentative or abductive reasoning. The algorithm c...
SOFSEM
2007
Springer
14 years 1 months ago
2007
Springer
Prior algorithms known for exactly solving Max 2-Sat improve upon the trivial upper bound only for very sparse instances. We present new algorithms for exactly solving (in fact, c...
EPEW
2007
Springer
14 years 1 months ago
2007
Springer
We consider a class of Markov chains known for its closed form transient and steady-state distributions. We show that some absorbing chains can be also seen as members of this clas...
JMMA
2010
13 years 2 months ago
2010
An original algorithm is presented that generates both restricted integer compositions and restricted integer partitions that can be constrained simultaneously by a) upper and low...
ICIP
2004
IEEE
14 years 9 months ago
2004
IEEE
We propose a registration algorithm based on successively refined quantization and an alignment metric derived from a minimal spanning tree entropy estimate. The metric favors edg...