1263 search results - page 18 / 253 » A* with Bounded Costs |
JCT
1998
14 years 9 months ago
1998
For k > 2 and r ≥ 2, let G(k, r) denote the smallest positive integer g such that every increasing sequence of g integers {a1, a2, . . . , ag} with gaps aj+1 − aj ∈ {1, ....
ISITA
2010
14 years 7 months ago
2010
Abstract--A Rayleigh block-fading multiple-input multipleoutput (MIMO) channel with channel state information (CSI) available neither to the transmitter nor to the receiver is cons...
LPAR
2001
Springer
15 years 2 months ago
2001
Springer
Logical omniscience is a well known problem which makes traditional modal logics of knowledge, belief and intentions somewhat unrealistic from the point of view of modelling the be...
ALT
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We consider an upper confidence bound algorithm for Markov decision processes (MDPs) with deterministic transitions. For this algorithm we derive upper bounds on the onl...
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...