2796 search results - page 358 / 560 » The coolest path problem |
179
click to vote
AAAI
1996
15 years 7 months ago
1996
In this paper we describe the design and implementation of the derivation replay framework, dersnlp+ebl (Derivational snlp+ebl), which is based within a partial order planner. der...
152
click to vote
WSC
2004
15 years 7 months ago
2004
We consider the steady state output analysis problem for a process that satisfies a functional central limit theorem. We construct asymptotically valid confidence intervals for th...
134
click to vote
EJC
2010
15 years 6 months ago
2010
We study two enumeration problems for up-down alternating trees, i.e., rooted labelled trees T, where the labels v1, v2, v3, . . . on every path starting at the root of T satisfy v...
148
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
This article is not a research paper, but a little note on the history of combinatorics: we present here a tentative short biography of Henri Delannoy, and a survey of his most no...
167
click to vote
COMBINATORICS
2000
15 years 6 months ago
2000
This note extends a recent result of Kannan, Tetali and Vempala to completely solve, via a simple proof, the problem of random generation of a labeled tournament with a given scor...