Sciweavers

14518 search results - page 7 / 2904
» Two Problems for Sophistication
Sort
View
GECCO
2003
Springer
415views Optimization» more  GECCO 2003»
14 years 25 days ago
Evolutionary Algorithms for Two Problems from the Calculus of Variations
Abstract. A brachistochrone is the path along which a weighted particle falls most quickly from one point to another, and a catenary is the smooth curve connecting two points whose...
Bryant A. Julstrom
ICCV
2007
IEEE
14 years 9 months ago
Two Minimal Problems for Cameras with Radial Distortion
Epipolar geometry and relative camera pose computation for uncalibrated cameras with radial distortion has recently been formulated as a minimal problem and successfully solved in...
Tomás Pajdla, Zuzana Kukelova
MOC
2002
92views more  MOC 2002»
13 years 7 months ago
Effects of uncertainties in the domain on the solution of Neumann boundary value problems in two spatial dimensions
An essential part of any boundary value problem is the domain on which the problem is defined. The domain is often given by scanning or another digital image technique with limited...
Ivo Babuska, Jan Chleboun
ORL
1998
136views more  ORL 1998»
13 years 7 months ago
A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs
Recently, Becker and Geiger and Bafna, Berman and Fujito gave 2-approximation algorithms for the feedback vertex set problem in undirected graphs. We show how their algorithms can...
Fabián A. Chudak, Michel X. Goemans, Dorit ...
FOGA
2011
12 years 11 months ago
Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
Greg Durrett, Frank Neumann, Una-May O'Reilly