Sciweavers

3250 search results - page 431 / 650
» An Algorithm to Solve a Linear Program
Sort
View
SIGGRAPH
2000
ACM
15 years 10 months ago
Out-of-core simplification of large polygonal models
We present an algorithm for out-of-core simplification of large polygonal datasets that are too complex to fit in main memory. The algorithm extends the vertex clustering scheme o...
Peter Lindstrom
GECCO
2009
Springer
112views Optimization» more  GECCO 2009»
16 years 1 months ago
Approximating geometric crossover in semantic space
We propose a crossover operator that works with genetic programming trees and is approximately geometric crossover in the semantic space. By defining semantic as program’s eval...
Krzysztof Krawiec, Pawel Lichocki
CRV
2006
IEEE
223views Robotics» more  CRV 2006»
16 years 17 days ago
Disparity Map Estimation Using A Total Variation Bound
This paper describes a new variational method for estimating disparity from stereo images. The stereo matching problem is formulated as a convex programming problem in which an ob...
Wided Miled, Jean-Christophe Pesquet
PPDP
2005
Springer
16 years 1 hour ago
Heuristics, optimizations, and parallelism for protein structure prediction in CLP(FD)
The paper describes a constraint-based solution to the protein folding problem on face-centered cubic lattices—a biologically meaningful approximation of the general protein fol...
Alessandro Dal Palù, Agostino Dovier, Enric...
GECCO
1999
Springer
167views Optimization» more  GECCO 1999»
15 years 10 months ago
A Biologically Inspired Fitness Function for Robotic Grasping
This paper describes the innovative use of genetic programming (GP) to solve the grasp synthesis problem for multifingered robot hands. The goal of our algorithm is to select a Ò...
J. Jaime Fernandez, Ian D. Walker