738 search results - page 110 / 148 » cases 2001 |
153
click to vote
COLT
2001
Springer
15 years 10 months ago
2001
Springer
We describe a new boosting algorithm which generates only smooth distributions which do not assign too much weight to any single example. We show that this new boosting algorithm ...
163
Voted
CONCUR
2001
Springer
15 years 10 months ago
2001
Springer
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
148
click to vote
CP
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. Computing lower bounds to the best-cost extension of a tuple is an ubiquous task in constraint optimization. A particular case of special interest is the computation of l...
156
Voted
CP
2001
Springer
15 years 10 months ago
2001
Springer
Non-binary constraint satisfaction problems (CSPs) can be solved in two different ways. We can either translate the problem into an equivalent binary one and solve it using well-e...
129
click to vote
ECAL
2001
Springer
15 years 9 months ago
2001
Springer
Amorphous computing is a recently introduced paradigm that favours geometrical configurations. The physical layout of an amorphous computer is based on a possibly irregular and er...