Sciweavers

4903 search results - page 551 / 981
» The Set Covering Machine
Sort
View
149
Voted
ECML
2004
Springer
16 years 7 days ago
Learning from Message Pairs for Automatic Email Answering
Abstract. We consider the problem of learning a mapping from question to answer messages. The training data for this problem consist of pairs of messages that have been received an...
Steffen Bickel, Tobias Scheffer
SAMOS
2004
Springer
16 years 6 days ago
The Molen Programming Paradigm
— In this paper we present the Molen programming paradigm, which is a sequential consistency paradigm for programming Custom Computing Machines (CCM). The programming paradigm al...
Stamatis Vassiliadis, Georgi Gaydadjiev, Koen Bert...
TAL
2004
Springer
16 years 6 days ago
Smoothing and Word Sense Disambiguation
This paper presents an algorithm to apply the smoothing techniques described in [1] to three different Machine Learning (ML) methods for Word Sense Disambiguation (WSD). The method...
Eneko Agirre, David Martínez
202
Voted
COLT
2003
Springer
16 years 2 days ago
Lower Bounds on the Sample Complexity of Exploration in the Multi-armed Bandit Problem
We consider the Multi-armed bandit problem under the PAC (“probably approximately correct”) model. It was shown by Even-Dar et al. [5] that given n arms, it suffices to play th...
Shie Mannor, John N. Tsitsiklis
EMO
2003
Springer
136views Optimization» more  EMO 2003»
16 years 2 days ago
Solving Multi-criteria Optimization Problems with Population-Based ACO
In this paper a Population-based Ant Colony Optimization approach is proposed to solve multi-criteria optimization problems where the population of solutions is chosen from the set...
Michael Guntsch, Martin Middendorf