Sciweavers

10608 search results - page 669 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
ICMLA
2004
15 years 8 months ago
Satisficing Q-learning: efficient learning in problems with dichotomous attributes
In some environments, a learning agent must learn to balance competing objectives. For example, a Q-learner agent may need to learn which choices expose the agent to risk and whic...
Michael A. Goodrich, Morgan Quigley
GECCO
2008
Springer
143views Optimization» more  GECCO 2008»
15 years 8 months ago
Collective intelligence and bush fire spotting
Bush fires cause major damage each year in many areas of the world and the earlier that they can be detected the easier it is to minimize this damage. This paper describes a coll...
David Howden, Tim Hendtlass
GECCO
2008
Springer
118views Optimization» more  GECCO 2008»
15 years 8 months ago
Theoretical analysis of diversity mechanisms for global exploration
Maintaining diversity is important for the performance of evolutionary algorithms. Diversity mechanisms can enhance global exploration of the search space and enable crossover to ...
Tobias Friedrich, Pietro Simone Oliveto, Dirk Sudh...
ICASSP
2010
IEEE
15 years 7 months ago
Subpixel motion estimation without interpolation
We propose a fast subpixel motion estimation method for motion deblurring, where conventional motion estimation algorithms used in video codings are too complex. The new algorithm...
Stanley H. Chan, Dung Trung Vo, Truong Q. Nguyen
164
Voted
AMC
2007
90views more  AMC 2007»
15 years 7 months ago
Computing the square roots of matrices with central symmetry
: For computing square roots of a nonsingular matrix A, which are functions of A, two well known fast and stable algorithms, which are based on the Schur decomposition of A, were p...
Zhongyun Liu, Yulin Zhang, Rui Ralha