4281 search results - page 50 / 857 » How to Disembed a Program |
SERP
2004
13 years 9 months ago
2004
Program restructuring or refactoring is often required when a function becomes too large or is involved in multiple activities and therefore exhibits low cohesion. A critical fact...
AUTOMATICA
2008
13 years 7 months ago
2008
A wide variety of stability and performance questions about linear dynamical systems can be reformulated as convex optimization problems involving linear matrix inequalities (LMIs...
JFR
2006
13 years 7 months ago
2006
The Defense Applied Research Projects Agency (DARPA) Learning Applied to Ground Vehicles (LAGR) program aims to develop algorithms for autonomous vehicle navigation that learn how...
MP
2006
13 years 7 months ago
2006
Decomposition algorithms such as Lagrangian relaxation and Dantzig-Wolfe decomposition are well-known methods that can be used to generate bounds for mixed-integer linear programmi...
GECCO
2009
Springer
13 years 5 months ago
2009
Springer
We provide an overview of using genetic programming (GP) to model stock returns. Our models employ GP terminals (model decision variables) that are financial factors identified by...