17760 search results - page 174 / 3552 » A Generalization of the Massey-Ding Algorithm |
130
Voted
NIPS
2007
15 years 5 months ago
2007
Guided by the goal of obtaining an optimization algorithm that is both fast and yields good generalization, we study the descent direction maximizing the decrease in generalizatio...
112
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
266
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
A new model for automatic generation of Evolutionary Algorithms (EAs) by evolutionary means is proposed in this paper. The model is based on a simple Genetic Algorithm (GA). Every...
162
click to vote
VL
2002
IEEE
15 years 9 months ago
2002
IEEE
Previous studies of program visualization have generally failed to provide convincing support for the benefits of algorithm animation in promoting the understanding of computatio...
144
click to vote
MFCS
2001
Springer
15 years 8 months ago
2001
Springer
Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview...