672 search results - page 49 / 135 » Almost Optimal Dispersers |
DSD
2003
IEEE
14 years 2 months ago
2003
IEEE
Heuristic algorithms for coloring the edges of large undirected single-edge graphs with (or very close to) the minimal number of colors are presented. Compared to simulated anneal...
GECCO
2003
Springer
14 years 2 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...
ESA
2001
Springer
14 years 2 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...
IPPS
1998
IEEE
14 years 1 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...
IJCAI
2003
13 years 11 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...