7773 search results - page 156 / 1555 » On generalized Frame-Stewart numbers |
COCO
2007
Springer
15 years 4 months ago
2007
Springer
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
ICALP
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. State-based systems and modal logics for reasoning about them often heterogeneously combine a number of features such as non-determinism and probabilities. Here, we show ...
PKDD
2007
Springer
15 years 4 months ago
2007
Springer
Nearest neighbour search (NNS) is an old problem that is of practical importance in a number of fields. It involves finding, for a given point q, called the query, one or more po...
85
Voted
GLOBECOM
2006
IEEE
15 years 4 months ago
2006
IEEE
— This paper considers the problem of finding the path with minimum (zero) worst possible number of errors in a network with V nodes where (1) some nodes are capable of correcti...
ICMCS
2006
IEEE
15 years 4 months ago
2006
IEEE
In layered P2P streaming system, how to allocate number of the copies for each layer is a challenging problem. In this paper, we present a substream allocation scheme in layered P...