2636 search results - page 51 / 528 » Linear Programming |
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
Recently, a form of memory usage was introduced for genetic programming (GP) called “soft memory.” Rather than have a new value completely overwrite the old value in a registe...
ISCI
1998
14 years 9 months ago
1998
: This paper describes the successful parallel implementation of genetic programming on a network of processing nodes using the transputer architecture. With this approach, researc...
CAV
2006
Springer
15 years 1 months ago
2006
Springer
We show that termination of a simple class of linear loops over the integers is decidable. Namely we show that termination of deterministic linear loops is decidable over the integ...
140
click to vote
ICAL
2011
13 years 9 months ago
2011
— In this paper, a numerical method (termed, E47 algorithm) based on linear variational inequalities (LVI) is presented and investigated to solve quadratic programming (QP) probl...
LOPSTR
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Termination of binary CLP programs has recently become an important question in the termination analysis community. The reason for this is due to that a number of approac...