777 search results - page 81 / 156 » A fast algorithm for the computation of an upper bound on th... |
WINET
2008
13 years 7 months ago
2008
This paper addresses the following relay sensor placement problem: given the set of duty sensors in the plane and the upper bound of the transmission range, compute the minimum nu...
TRANSCI
2011
13 years 2 months ago
2011
This paper presents a dynamic (or multi-period) hub location problem. It proposes a branch-and-bound algorithm that uses a Lagrangean relaxation to obtain lower and upper bounds a...
FCT
2003
Springer
14 years 27 days ago
2003
Springer
We present an Extended Quadratic Frobenius Primality Test (EQFT), which is related to the Miller-Rabin test and to several other known probabilistic tests. EQFT takes time equival...
WCNC
2008
IEEE
14 years 2 months ago
2008
IEEE
—This paper presents a novel ring-based approach to analyze the inter-flow capacity of a backhaul wireless mesh networks (WMNs) with centralized scheduling. Based on the property...
COCO
2007
Springer
14 years 1 months ago
2007
Springer
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....