5230 search results - page 145 / 1046 » Dynamic Optimality -- Almost |
126
click to vote
GECCO
2003
Springer
15 years 9 months ago
2003
Springer
Several researchers are using evolutionary search methods to search for test data with which to test a program. The fitness or cost function depends on the test goal but almost in...
143
click to vote
ESA
2001
Springer
15 years 8 months ago
2001
Springer
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
119
click to vote
IPPS
1998
IEEE
15 years 8 months ago
1998
IEEE
We derive cost formulae for three di erent parallelisation techniques for training supervised networks. These formulae are parameterised by properties of the target computer archit...
128
Voted
IJCAI
2003
15 years 5 months ago
2003
We extend multiclass SVM to multiple prototypes per class. For this framework, we give a compact constrained quadratic problem and we suggest an efficient algorithm for its optimi...
122
Voted
DM
2010
15 years 3 months ago
2010
The stability method is very useful for obtaining exact solutions of many extremal graph problems. Its key step is to establish the stability property which, roughly speaking, sta...