Sciweavers

648 search results - page 40 / 130
» Simple Algorithms for a Weighted Interval Selection Problem
Sort
View
GECCO
2008
Springer
131views Optimization» more  GECCO 2008»
13 years 8 months ago
Rigorous analyses of fitness-proportional selection for optimizing linear functions
Rigorous runtime analyses of evolutionary algorithms (EAs) mainly investigate algorithms that use elitist selection methods. Two algorithms commonly studied are Randomized Local S...
Edda Happ, Daniel Johannsen, Christian Klein, Fran...
INFORMATICALT
2002
154views more  INFORMATICALT 2002»
13 years 7 months ago
Adaptive Stable Control of Manipulators with Improved Adaptation Transients by Using On-line Supervision of the Free-Parameters
An adaptive control scheme for mechanical manipulators is proposed. The control loop essentially consists of a network for learning the robot's inverse dynamics and on-line ge...
Manuel de la Sen, Ana Almansa
ICIP
2007
IEEE
14 years 2 months ago
Mean-Shift Blob Tracking with Adaptive Feature Selection and Scale Adaptation
When the appearances of the tracked object and surrounding background change during tracking, fixed feature space tends to cause tracking failure. To address this problem, we prop...
Dawei Liang, Qingming Huang, Shuqiang Jiang, Hongx...
SDM
2010
SIAM
165views Data Mining» more  SDM 2010»
13 years 9 months ago
Exact Passive-Aggressive Algorithm for Multiclass Classification Using Support Class
The Passive Aggressive framework [1] is a principled approach to online linear classification that advocates minimal weight updates i.e., the least required so that the current tr...
Shin Matsushima, Nobuyuki Shimizu, Kazuhiro Yoshid...
SIAMCOMP
2010
133views more  SIAMCOMP 2010»
13 years 6 months ago
Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs
Let G = (V, E) be a weighted undirected graph having non-negative edge weights. An estimate ˆδ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t...
Surender Baswana, Telikepalli Kavitha