Sciweavers

6693 search results - page 1214 / 1339
» On an anytime algorithm for control
Sort
View
APPROX
2010
Springer
168views Algorithms» more  APPROX 2010»
13 years 9 months ago
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
Arnab Bhattacharyya, Elena Grigorescu, Madhav Jha,...
DAGSTUHL
2007
13 years 9 months ago
Logical Particle Filtering
Abstract. In this paper, we consider the problem of filtering in relational hidden Markov models. We present a compact representation for such models and an associated logical par...
Luke S. Zettlemoyer, Hanna M. Pasula, Leslie Pack ...
RIVF
2007
13 years 9 months ago
Stochastic routing in large grid-shaped quantum networks
— This paper investigates the problem of secret key transmissions for an arbitrary Alice-Bob pair in Quantum Key Distribution (QKD)-based networks. We develop a realistic QKDbase...
Cuong Le Quoc, Patrick Bellot, Akim Demaille
CASCON
1996
72views Education» more  CASCON 1996»
13 years 9 months ago
A robot agent that can search
Object search is the task of eciently searching for a given 3D object in a given 3D environment by an agent equipped with a camera for target detection and, if the environment con...
Yiming Ye, John K. Tsotsos
GECCO
2008
Springer
114views Optimization» more  GECCO 2008»
13 years 9 months ago
Strategic positioning in tactical scenario planning
Capability planning problems are pervasive throughout many areas of human interest with prominent examples found in defense and security. Planning provides a unique context for op...
James M. Whitacre, Hussein A. Abbass, Ruhul A. Sar...
« Prev « First page 1214 / 1339 Last » Next »