4903 search results - page 619 / 981 » The Set Covering Machine |
177
click to vote
ICDCS
2007
IEEE
15 years 10 months ago
2007
IEEE
In recent work, we proposed D-Trigger, a framework for tracking a global condition over a large network that allows us to detect anomalies while only collecting a very limited amo...
157
click to vote
COLT
2006
Springer
15 years 10 months ago
2006
Springer
U-shaped learning is a learning behaviour in which the learner first learns a given target behaviour, then unlearns it and finally relearns it. Such a behaviour, observed by psych...
166
click to vote
COLT
2006
Springer
15 years 10 months ago
2006
Springer
Given a finite set of words w1, . . . , wn independently drawn according to a fixed unknown distribution law P called a stochastic language, an usual goal in Grammatical Inference ...
166
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
The max k-armed bandit problem is a recently-introduced online optimization problem with practical applications to heuristic search. Given a set of k slot machines, each yielding p...
167
click to vote
ECAI
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. A well-known difficulty with solving Constraint Satisfaction Problems (CSPs) is that, while one formulation of a CSP may enable a solver to solve it quickly, a different ...