Sciweavers

3250 search results - page 104 / 650
» An Algorithm to Solve a Linear Program
Sort
View
MOC
1998
97views more  MOC 1998»
14 years 9 months ago
Euclid's algorithm and the Lanczos method over finite fields
Abstract. This paper shows that there is a close relationship between the Euclidean algorithm for polynomials and the Lanczos method for solving sparse linear systems, especially w...
Jeremy Teitelbaum
FOGA
2011
14 years 1 months ago
Approximating the distribution of fitness over hamming regions
The distribution of fitness values across a set of states sharply influences the dynamics of evolutionary processes and heuristic search in combinatorial optimization. In this p...
Andrew M. Sutton, Darrell Whitley, Adele E. Howe
VL
1994
IEEE
121views Visual Languages» more  VL 1994»
15 years 1 months ago
Using 3D Tubes to Solve the Intersecting Line Representation Problem
In this paper we discuss 3D rendering as a solution to the line crossing problem associated with using connecting lines for illustrating relations in visual programming. The Bezie...
Lindsey L. Spratt, Allen L. Ambler
ICML
2010
IEEE
14 years 11 months ago
Simple and Efficient Multiple Kernel Learning by Group Lasso
We consider the problem of how to improve the efficiency of Multiple Kernel Learning (MKL). In literature, MKL is often solved by an alternating approach: (1) the minimization of ...
Zenglin Xu, Rong Jin, Haiqin Yang, Irwin King, Mic...
GECCO
2005
Springer
108views Optimization» more  GECCO 2005»
15 years 3 months ago
Evolving recurrent models using linear GP
Turing complete Genetic Programming (GP) models introduce the concept of internal state, and therefore have the capacity for identifying interesting temporal properties. Surprisin...
Xiao Luo, Malcolm I. Heywood, A. Nur Zincir-Heywoo...