854 search results - page 112 / 171 » Abstracting from Failure Probabilities |
126
click to vote
FOSSACS
2004
Springer
15 years 10 months ago
2004
Springer
Labelled Markov processes (LMPs) are automata whose transitions are given by probability distributions. In this paper we present a ‘universal’ LMP as the spectrum of a commutat...
141
click to vote
GECCO
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We derive a continuous probability distribution which generates neighbours of a point in an interval in a similar way to the bitwise mutation of a Gray code binary string...
136
click to vote
IBERAMIA
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. In constraint satisfaction, a general rule is to tackle the hardest part of a search problem first. In this paper, we introduce a parameter (τ) that measures the constr...
115
click to vote
ECML
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. Classical learning algorithms from the fields of artificial neural networks and machine learning, typically, do not take any costs into account or allow only costs depe...
121
click to vote
IBPRIA
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. We compare two successful discriminative classification algorithms on three databases from the UCI and STATLOG repositories. The two approaches are the log-linear model ...