AIPS
2011
12 years 8 months ago
2011
We define a probe to be a single action sequence computed greedily from a given state that either terminates in the goal or fails. We show that by designing these probes carefull...
COMBINATORICS
2007
13 years 4 months ago
2007
We generalize the classical work of de Bruijn, Knuth and Rice (giving the asymptotics of the average height of Dyck paths of length n) to the case of p–watermelons with a wall (...
COMBINATORICS
2007
13 years 4 months ago
2007
Let λ be a partition, and denote by fλ the number of standard tableaux of shape λ. The asymptotic shape of λ maximizing fλ was determined in the classical work of Logan and S...