Sciweavers

3221 search results - page 60 / 645
» Termination of Linear Programs
Sort
View
ISCI
1998
193views more  ISCI 1998»
13 years 7 months ago
A Parallel Implementation of Genetic Programming that Achieves Super-Linear Performance
: This paper describes the successful parallel implementation of genetic programming on a network of processing nodes using the transputer architecture. With this approach, researc...
David Andre, John R. Koza
ICML
2010
IEEE
13 years 9 months ago
Feature Selection Using Regularization in Approximate Linear Programs for Markov Decision Processes
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...
Marek Petrik, Gavin Taylor, Ronald Parr, Shlomo Zi...
CPAIOR
2007
Springer
14 years 2 months ago
The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width
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...
Meinolf Sellmann, Luc Mercier, Daniel H. Leventhal
CISS
2007
IEEE
14 years 2 months ago
Sensor Location through Linear Programming with Arrival Angle Constraints
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...
Camillo Gentile, John Shiu
EUROGP
2003
Springer
119views Optimization» more  EUROGP 2003»
14 years 1 months ago
Maximum Homologous Crossover for Linear Genetic Programming
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...
Michael Defoin-Platel, Manuel Clergue, Philippe Co...