275 search results - page 13 / 55 » On the computational power of iterative auctions |
SIPS
2006
IEEE
15 years 3 months ago
2006
IEEE
Although many stopping methods of iterative decoding have been discussed in the literatures extensively, many of them only focus on the solvable decoding. In this paper, we propos...
FS
2006
14 years 9 months ago
2006
Abstract. We present an iterative procedure for computing the optimal Bermudan stopping time, hence the Bermudan Snell envelope. The method produces an increasing sequence of appro...
FOSSACS
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. We solve the problem of extending Bird and Paterson’s generalized folds for nested datatypes and its dual to inductive and coinductive constructors of arbitrarily high ...
ECML
2001
Springer
15 years 2 months ago
2001
Springer
We present a powerful meta-clustering technique called Iterative Double Clustering (IDC). The IDC method is a natural extension of the recent Double Clustering (DC) method of Slon...
ECAI
2008
Springer
14 years 11 months ago
2008
Springer
Many real-world applications of AI require both probability and first-order logic to deal with uncertainty and structural complexity. Logical AI has focused mainly on handling com...