Sciweavers

415 search results - page 24 / 83
» An efficient approximation for the Generalized Assignment Pr...
Sort
View
STACS
2001
Springer
14 years 28 days ago
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
Andrea E. F. Clementi, Pierluigi Crescenzi, Paolo ...
SIAMCOMP
2000
125views more  SIAMCOMP 2000»
13 years 8 months ago
Approximating the Stretch Factor of Euclidean Graphs
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
Giri Narasimhan, Michiel H. M. Smid
WWW
2008
ACM
14 years 9 months ago
Offline matching approximation algorithms in exchange markets
Motivated by several marketplace applications on rapidly growing online social networks, we study the problem of efficient offline matching algorithms for online exchange markets....
Zeinab Abbassi, Laks V. S. Lakshmanan
JMLR
2010
148views more  JMLR 2010»
13 years 3 months ago
A Generalized Path Integral Control Approach to Reinforcement Learning
With the goal to generate more scalable algorithms with higher efficiency and fewer open parameters, reinforcement learning (RL) has recently moved towards combining classical tec...
Evangelos Theodorou, Jonas Buchli, Stefan Schaal
3DIM
2003
IEEE
14 years 4 days ago
Efficient Reconstruction of Indoor Scenes with Color
In this paper we present an efficient and general approach to computing and integrating 3D distance fields directly from multiple range images. We compute normal and confidence va...
Rui Wang 0003, David P. Luebke