Sciweavers

1725 search results - page 9 / 345
» Relaxed genetic programming
Sort
View
CVPR
2006
IEEE
14 years 9 months ago
Solving Markov Random Fields using Second Order Cone Programming Relaxations
This paper presents a generic method for solving Markov random fields (MRF) by formulating the problem of MAP estimation as 0-1 quadratic programming (QP). Though in general solvi...
M. Pawan Kumar, Philip H. S. Torr, Andrew Zisserma...
OL
2011
177views Neural Networks» more  OL 2011»
12 years 10 months ago
Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of proce
In this paper we present a methodology for finding tight convex relaxations for a special set of quadratic constraints given by bilinear and linear terms that frequently arise in ...
Juan P. Ruiz, Ignacio E. Grossmann
EUROGP
2004
Springer
135views Optimization» more  EUROGP 2004»
14 years 29 days ago
Reusing Code in Genetic Programming
Abstract. In this paper we propose an approach to Genetic Programming based on code reuse and we test it in the design of combinational logic circuits at the gate-level. The circui...
Edgar Galván López, Riccardo Poli, C...
GECCO
2004
Springer
127views Optimization» more  GECCO 2004»
14 years 29 days ago
Automatic Synthesis of an 802.11a Wireless LAN Antenna Using Genetic Programming A Real World Application
This paper describes the application of genetic programming to synthesize a small form factor, 2 dimensional wire antenna for a 5.2 GHz 802.11a wireless LAN application. Utilizing ...
Rian Sanderson
GPEM
2007
84views more  GPEM 2007»
13 years 7 months ago
The structure of the genetic programming collaboration network
The genetic programming bibliography aims to be the most complete reference of papers on genetic programming. In addition to locating publications, it contains coauthor and coedit...
Marco Tomassini, Leslie Luthi, Mario Giacobini, Wi...