Sciweavers

820 search results - page 41 / 164
» A Search Algorithm for Global Optimisation
Sort
View
ICPR
2008
IEEE
15 years 6 months ago
Fast model selection for MaxMinOver-based training of support vector machines
OneClassMaxMinOver (OMMO) is a simple incremental algorithm for one-class support vector classification. We propose several enhancements and heuristics for improving model select...
Fabian Timm, Sascha Klement, Thomas Martinetz
82
Voted
ICIP
2007
IEEE
16 years 1 months ago
Automated Segmentation of Torn Frames using the Graph Cuts Technique
Film Tear is a form of degradation in archived film and is the physical ripping of the film material. Tear causes displacement of a region of the degraded frame and the loss of im...
David Corrigan, Naomi Harte, Anil C. Kokaram
AIPS
2006
15 years 1 months ago
Exploiting the Power of Local Search in a Branch and Bound Algorithm for Job Shop Scheduling
This paper presents three techniques for using an iterated local search algorithm to improve the performance of a state-of-the-art branch and bound algorithm for job shop scheduli...
Matthew J. Streeter, Stephen F. Smith
GECCO
2000
Springer
131views Optimization» more  GECCO 2000»
15 years 3 months ago
A Genetic Algorithm with Tabu Search for Multimodal and Multiobjective Function Optimization
The integration of genetic algorithms (GAs) and tabu search is one of traditional problems in function optimization in the GA literature. However, most proposed methods have utili...
Setsuya Kurahashi, Takao Terano
CEC
2010
IEEE
15 years 24 days ago
Beyond No Free Lunch: Realistic algorithms for arbitrary problem classes
In this paper we present a simple and general new No Free Lunch-like result that applies to revisiting algorithms searching arbitrary problem sets. We begin by unifying the assumpt...
James A. R. Marshall, Thomas G. Hinton