Sciweavers

5580 search results - page 618 / 1116
» Randomized priority algorithms
Sort
View
173
Voted
TAL
2010
Springer
15 years 3 months ago
Robust Semi-supervised and Ensemble-Based Methods in Word Sense Disambiguation
Mihalcea [1] discusses self-training and co-training in the context of word sense disambiguation and shows that parameter optimization on individual words was important to obtain g...
Anders Søgaard, Anders Johannsen
ANTSW
2010
Springer
15 years 2 months ago
Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem
Ant colony optimization (ACO) has been widely used for different combinatorial optimization problems. In this paper, we investigate ACO algorithms with respect to their runtime beh...
Timo Kötzing, Frank Neumann, Heiko Rögli...
COLT
2010
Springer
15 years 2 months ago
Hedging Structured Concepts
We develop an online algorithm called Component Hedge for learning structured concept classes when the loss of a structured concept sums over its components. Example classes inclu...
Wouter M. Koolen, Manfred K. Warmuth, Jyrki Kivine...
ICRA
2009
IEEE
100views Robotics» more  ICRA 2009»
15 years 2 months ago
Multi-robot plan adaptation by constrained minimal distortion feature mapping
We propose a novel method for multi-robot plan adaptation which can be used for adapting existing spatial plans of robotic teams to new environments or imitating collaborative spat...
Bálint Takács, Yiannis Demiris
ICTAI
2009
IEEE
15 years 2 months ago
Stochastic Offline Programming
We propose a framework which we call stochastic offline programming (SOP). The idea is to embed the development of combinatorial algorithms in an off-line learning environment whi...
Yuri Malitsky, Meinolf Sellmann