1725 search results - page 36 / 345 » Relaxed genetic programming |
135
Voted
AAAI
2012
13 years 6 months ago
2012
We address the problem of spatial conservation planning in which the goal is to maximize the expected spread of cascades of an endangered species by strategically purchasing land ...
119
Voted
CP
2005
Springer
15 years 9 months ago
2005
Springer
We present a method for propagating linear constraints. Our technique exploits the fact that the interior point method converges on a central point of the polytope. A variable assi...
130
Voted
TCS
2008
15 years 3 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
129
Voted
CDC
2010
IEEE
14 years 10 months ago
2010
IEEE
This paper proposes a novel approach to stability analysis and controller synthesis for discrete-time periodically time-varying systems. Firstly, a relaxation of standard Lyapunov ...
156
Voted
TIT
2010
14 years 10 months ago
2010
This paper is concerned with the problem of recovering an unknown matrix from a small fraction of its entries. This is known as the matrix completion problem, and comes up in a gr...