3663 search results - page 263 / 733 » Problems in the ontology of computer programs |
183
click to vote
GECCO
2010
Springer
15 years 10 months ago
2010
Springer
Foreign exchange (forex) market trading using evolutionary algorithms is an active and controversial area of research. We investigate the use of a linear genetic programming (LGP)...
174
click to vote
AUTOMATICA
2008
15 years 6 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...
185
click to vote
MP
2006
15 years 6 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...
160
click to vote
CP
2004
Springer
16 years 2 days ago
2004
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
178
Voted
DALT
2003
Springer
15 years 12 months ago
2003
Springer
Work on agent communication languages has since long striven to achieve adequate speech act semantics; partly, the problem is that references to an agent’s architecture (in parti...