5153 search results - page 526 / 1031 » Introduction to Randomized Algorithms |
160
Voted
FATES
2004
Springer
16 years 4 days ago
2004
Springer
We present the development of T-UPPAAL — a new tool for online black-box testing of real-time embedded systems from non-deterministic timed automata specifications. It is based ...
175
click to vote
IJCNLP
2004
Springer
16 years 4 days ago
2004
Springer
This paper explores collaborative ability of co-training algorithm. We propose a new measurement (CA) for representing the collaborative ability of co-training classifiers based o...
171
Voted
PPSN
2004
Springer
16 years 3 days ago
2004
Springer
Abstract. We introduce a model for cooperative coevolutionary algorithms (CCEAs) using partial mixing, which allows us to compute the expected long-run convergence of such algorith...
166
click to vote
AI
2003
Springer
16 years 8 hour ago
2003
Springer
MAX-SAT, the optimisation variant of the satisfiability problem in propositional logic, is an important and widely studied combinatorial optimisation problem with applications in ...
164
Voted
GECCO
2003
Springer
15 years 12 months ago
2003
Springer
For noisy optimization problems, there is generally a trade-off between the effort spent to reduce the noise (in order to allow the optimization algorithm to run properly), and t...