Sciweavers

4816 search results - page 81 / 964
» Performance analysis of the AntNet algorithm
Sort
View
171
Voted
FMOODS
2007
15 years 6 months ago
Formal Modeling and Analysis of the OGDC Wireless Sensor Network Algorithm in Real-Time Maude
This paper describes the application of Real-Time Maude to the formal specification, simulation, and further formal analysis of the sophisticated state-of-the-art OGDC wireless se...
Peter Csaba Ölveczky, Stian Thorvaldsen
FUN
2007
Springer
169views Algorithms» more  FUN 2007»
15 years 6 months ago
Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting Algorithms
This paper is devoted to the “Discovery of Slowness.” The archetypical perversely awful algorithm bogo-sort, which is sometimes referred to as Monkey-sort, is analyzed with ele...
Hermann Gruber, Markus Holzer, Oliver Ruepp
NIPS
2008
15 years 6 months ago
Signal-to-Noise Ratio Analysis of Policy Gradient Algorithms
Policy gradient (PG) reinforcement learning algorithms have strong (local) convergence guarantees, but their learning performance is typically limited by a large variance in the e...
John W. Roberts, Russ Tedrake
ICDAR
2003
IEEE
15 years 10 months ago
Postal address block location by contour clustering
We have developed a well performing algorithm for locating address blocks in postal parcel images. Both machine printed and handwritten addresses are processed by the algorithm. T...
Venu Govindaraju, Sergey Tulyakov
JCST
2010
189views more  JCST 2010»
14 years 11 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar