1725 search results - page 141 / 345 » Relaxed genetic programming |
83
Voted
HEURISTICS
2002
14 years 10 months ago
2002
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
73
Voted
CVPR
2010
IEEE
15 years 4 months ago
2010
IEEE
We examine the shape from shading problem without boundary conditions as a polynomial system. This view allows, in generic cases, a complete solution for ideal polyhedral objects....
66
Voted
MP
2006
14 years 10 months ago
2006
Consider a 0/1 integer program min{cT x : Ax b, x {0, 1}n } where A is nonnegative. We show that if the number of minimal covers of Ax b is polynomially bounded, then there is ...
CORR
2011
Springer
14 years 5 months ago
2011
Springer
Abstract. We consider the issue of exploiting symmetries in the hierarchy of semidefinite programming relaxations recently introduced in polynomial optimization. We focus on probl...
FLAIRS
2007
15 years 1 months ago
2007
To describe and explain the world, scientists search for equations that quantify relations among relevant variables. We wanted to assist these efforts by a computer program inspir...