817 search results - page 52 / 164 » Exact solutions to linear programming problems |
GECCO
2009
Springer
14 years 3 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...
ICPR
2008
IEEE
14 years 3 months ago
2008
IEEE
We have considered a problem of continuous piecewise linear approximation of the digital curves with a minimum number of the line segments. Fast suboptimal algorithm for constrain...
ICIP
2003
IEEE
14 years 10 months ago
2003
IEEE
An efficient method for rate control is illustrated for joint source-channel rate selection and for encoding under multiple leaky bucket buffer constraints. This method shows adva...
ESA
2005
Springer
14 years 2 months ago
2005
Springer
We study a wide range of online covering and packing optimization problems. In an online covering problem a linear cost function is known in advance, but the linear constraints th...
EOR
2008
13 years 9 months ago
2008
Consider a problem of minimizing a separable, strictly convex, monotone and differentiable function on a convex polyhedron generated by a system of m linear inequalities. The probl...