Sciweavers

309 search results - page 12 / 62
» Partial Move A*
Sort
View
WOWMOM
2009
ACM
143views Multimedia» more  WOWMOM 2009»
15 years 4 months ago
Improving partial cover of Random Walks in large-scale Wireless Sensor Networks
Random Walks (RWs) have been considered for information dissemination in large scale, dynamic and unstructured environments, as they are scalable, robust to topology changes and d...
Leonidas Tzevelekas, Ioannis Stavrakakis
85
Voted
ESA
2008
Springer
148views Algorithms» more  ESA 2008»
14 years 11 months ago
Selfish Bin Packing
Following recent interest in the study of computer science problems in a game theoretic setting, we consider the well known bin packing problem where the items are controlled by se...
Leah Epstein, Elena Kleiman
ISCAS
2005
IEEE
103views Hardware» more  ISCAS 2005»
15 years 3 months ago
Why area might reduce power in nanoscale CMOS
— In this paper we explore the relationship between power and area. By exploiting parallelism (and thus using more area) one can reduce the switching frequency allowing a reducti...
Paul Beckett, S. C. Goldstein
MVA
1992
128views Computer Vision» more  MVA 1992»
14 years 10 months ago
Computation of Surface Curvature from Range Images Using Geometrically Intrinsic Weights
This paper presents a method to compute Mean and Gaussian curvatures from range images. The first and second partial derivatives are estimated by the weighted least squares fit of...
Takio Kurita, Pierre Boulanger
CORR
2010
Springer
95views Education» more  CORR 2010»
14 years 9 months ago
Optimization and Convergence of Observation Channels in Stochastic Control
This paper studies the optimization of observation channels (stochastic kernels) in partially observed stochastic control problems. In particular, existence, continuity, and convex...
Serdar Yüksel, Tamás Linder