Sciweavers

1210 search results - page 144 / 242
» Newton's method and its use in optimization
Sort
View
GECCO
2009
Springer
152views Optimization» more  GECCO 2009»
15 years 6 months ago
A data-based coding of candidate strings in the closest string problem
Given a set of strings S of equal lengths over an alphabet Σ, the closest string problem seeks a string over Σ whose maximum Hamming distance to any of the given strings is as s...
Bryant A. Julstrom
ICCV
2009
IEEE
16 years 6 months ago
Extending Continuous Cuts: Anisotropic Metrics and Expansion Moves
The concept of graph cuts is by now a standard method for all sorts of low level vision problems. Its popularity is largely due to the fact that globally or near globally optimal...
Carl Olsson, Martin Byr¨od, Niels Chr. Overgaard,...
SOCO
2010
Springer
15 years 9 days ago
Automatic circle detection on digital images with an adaptive bacterial foraging algorithm
This article presents an algorithm for the automatic detection of circular shapes from complicated and noisy images without using the conventional Hough transform methods. The prop...
Sambarta Dasgupta, Swagatam Das, Arijit Biswas, Aj...
COR
2006
97views more  COR 2006»
15 years 1 months ago
Evaluating the performance of cost-based discretization versus entropy- and error-based discretization
Discretization is defined as the process that divides continuous numeric values into intervals of discrete categorical values. In this article, the concept of cost-based discretiz...
Davy Janssens, Tom Brijs, Koen Vanhoof, Geert Wets
GECCO
2006
Springer
140views Optimization» more  GECCO 2006»
15 years 5 months ago
A representational ecology for learning classifier systems
The representation used by a learning algorithm introduces a bias which is more or less well-suited to any given learning problem. It is well known that, across all possible probl...
James A. R. Marshall, Tim Kovacs