3221 search results - page 60 / 645 » Termination of Linear Programs |
151
click to vote
ISCI
1998
15 years 4 months ago
1998
: This paper describes the successful parallel implementation of genetic programming on a network of processing nodes using the transputer architecture. With this approach, researc...
157
click to vote
ICML
2010
IEEE
15 years 5 months ago
2010
IEEE
Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...
137
click to vote
CPAIOR
2007
Springer
15 years 10 months ago
2007
Springer
We show how to efficiently model binary constraint problems (BCP) as integer programs. After considering tree-structured BCPs first, we show that a Sherali-Adams-like procedure r...
137
click to vote
CISS
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract— In previous work, we established a linear programming framework to determine sensor location from measured link distances between neighboring nodes in a network. Beside...
141
click to vote
EUROGP
2003
Springer
15 years 9 months ago
2003
Springer
We introduce a new recombination operator, the Maximum Homologous Crossover for Linear Genetic Programming. In contrast to standard crossover, it attempts to preserve similar struc...