Sciweavers

5090 search results - page 219 / 1018
» Constructing Strategies for Programming
Sort
View
100
Voted
IPCO
2001
125views Optimization» more  IPCO 2001»
15 years 4 months ago
An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs
Abstract. We consider the general nonlinear optimization problem in 01 variables and provide an explicit equivalent convex positive semidefinite program in 2n - 1 variables. The op...
Jean B. Lasserre
106
Voted
ANOR
2007
80views more  ANOR 2007»
15 years 2 months ago
Branch and bound, integer, and non-integer programming
In this note we review the development of the first commercial branch and bound codes at CEIR/Scicon, with particular emphasis on those features not commonly emphasized today - t...
John J. H. Forrest, John A. Tomlin
123
Voted
TSMC
1998
132views more  TSMC 1998»
15 years 2 months ago
Decision support for vehicle dispatching using genetic programming
—Vehicle dispatching consists of allocating real-time service requests to a fleet of moving vehicles. In this paper, each vehicle is associated with a vector of attribute values...
Ilham Benyahia, Jean-Yves Potvin
128
Voted
ICIP
2001
IEEE
16 years 4 months ago
Easy Java programming for teaching image-processing
We have designed a series of computer sessions build around ImageJ (a public-domain software for image analysis), as a practical complement to a two-semester course in image proce...
Daniel Sage, Michael Unser
CEC
2005
IEEE
15 years 8 months ago
Linear genetic programming using a compressed genotype representation
This paper presents a modularization strategy for linear genetic programming (GP) based on a substring compression/substitution scheme. The purpose of this substitution scheme is t...
Johan Parent, Ann Nowé, Kris Steenhaut, Ann...