Sciweavers

779 search results - page 72 / 156
» Algorithms for the Sample Mean of Graphs
Sort
View
GECCO
2010
Springer
157views Optimization» more  GECCO 2010»
15 years 6 months ago
Mirrored variants of the (1, 4)-CMA-ES compared on the noiseless BBOB-2010 testbed
Derandomization by means of mirrored samples has been recently introduced to enhance the performances of (1, λ)Evolution-Strategies (ESs) with the aim of designing fast and robus...
Anne Auger, Dimo Brockhoff, Nikolaus Hansen
FOCM
2011
113views more  FOCM 2011»
14 years 11 months ago
Finite Resolution Dynamics
We develop a new mathematical model for describing a dynamical system at limited resolution (or finite scale), and we give precise meaning to the notion of a dynamical system havi...
Stefano Luzzatto, Pawel Pilarczyk
ICML
2000
IEEE
16 years 5 months ago
Learning Probabilistic Models for Decision-Theoretic Navigation of Mobile Robots
Decision-theoretic reasoning and planning algorithms are increasingly being used for mobile robot navigation, due to the signi cant uncertainty accompanying the robots' perce...
Daniel Nikovski, Illah R. Nourbakhsh
ANLP
1992
116views more  ANLP 1992»
15 years 5 months ago
Automatic Learning for Semantic Collocation
The real di culty in development of practical NLP systems comes from the fact that we do not have e ective means for gathering \knowledge". In this paper, we propose an algor...
Satoshi Sekine, Jeremy J. Carroll, Sophia Ananiado...
ICCCN
2007
IEEE
15 years 4 months ago
Online Selection of Tracking Features using AdaBoost
In this paper, a novel feature selection algorithm for object tracking is proposed. This algorithm performs more robust than the previous works by taking the correlation between f...
Ying-Jia Yeh, Chiou-Ting Hsu