68 search results - page 12 / 14 » Constraint Satisfaction for Relative Location Assignment and... |
CORR
2007
Springer
14 years 9 months ago
2007
Springer
—This paper addresses three issues in the field of ad hoc network capacity: the impact of i) channel fading, ii) channel inversion power control, and iii) threshold–based sche...
83
Voted
GLOBECOM
2008
IEEE
15 years 3 months ago
2008
IEEE
—In this paper, we address the problem of establishing full connectivity and satisfying required traffic capacity between disconnected clusters in large wireless ad-hoc ground n...
ECP
1997
Springer
15 years 1 months ago
1997
Springer
We provide a reconstruction of Blum and Furst’s Graphplan algorithm, and use the reconstruction to extend and improve the original algorithm in several ways. In our reconstructi...
CPAIOR
2008
Springer
14 years 11 months ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
100
click to vote
CORR
2006
Springer
14 years 9 months ago
2006
Springer
Suppose we are given a set of objects that cover a region and a duration associated with each object. Viewing the objects as jobs, can we schedule their beginning times to maximiz...