Sciweavers

2745 search results - page 272 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
16 years 2 months ago
Counting Stars and Other Small Subgraphs in Sublinear Time
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Mira Gonen, Dana Ron, Yuval Shavitt
GECCO
2009
Springer
124views Optimization» more  GECCO 2009»
15 years 9 months ago
Reinforcement learning for games: failures and successes
We apply CMA-ES, an evolution strategy with covariance matrix adaptation, and TDL (Temporal Difference Learning) to reinforcement learning tasks. In both cases these algorithms se...
Wolfgang Konen, Thomas Bartz-Beielstein
DAGM
2005
Springer
15 years 10 months ago
Cluster-Based Point Cloud Analysis for Rapid Scene Interpretation
A histogram-based method for the interpretation of three-dimensional (3D) point clouds is introduced, where point clouds represent the surface of a scene of multiple objects and ba...
Eric Wahl, Gerd Hirzinger
CN
2008
97views more  CN 2008»
15 years 5 months ago
Towards real-time dynamic spectrum auctions
In this paper, we propose a low-complexity auction framework to distribute spectrum in real-time among a large number of wireless users with dynamic traffic. Our design consists o...
Sorabh Gandhi, Chiranjeeb Buragohain, Lili Cao, Ha...
IPPS
2008
IEEE
15 years 11 months ago
Online scheduling in grids
This paper addresses nonclairvoyant and nonpreemptive online job scheduling in Grids. In the applied basic model, the Grid system consists of a large number of identical processor...
Uwe Schwiegelshohn, Andrei Tchernykh, Ramin Yahyap...