Sciweavers

715 search results - page 77 / 143
» Neighborhood structures for genetic local search algorithms
Sort
View
GECCO
2008
Springer
115views Optimization» more  GECCO 2008»
14 years 11 months ago
A genetic programming approach to business process mining
The aim of process mining is to identify and extract process patterns from data logs to reconstruct an overall process flowchart. As business processes become more and more comple...
Chris J. Turner, Ashutosh Tiwari, Jörn Mehnen
GECCO
2007
Springer
130views Optimization» more  GECCO 2007»
15 years 4 months ago
Variable discrimination of crossover versus mutation using parameterized modular structure
Recent work has provided functions that can be used to prove a principled distinction between the capabilities of mutation-based and crossover-based algorithms. However, prior fun...
Rob Mills, Richard A. Watson
JCP
2006
151views more  JCP 2006»
14 years 9 months ago
Simulated Annealing based Wireless Sensor Network Localization
In this paper, we describe a novel localization algorithm for ad hoc wireless sensor networks. Accurate selforganization and localization capability is a highly desirable character...
Anushiya A. Kannan, Guoqiang Mao, Branka Vucetic
TIP
2010
205views more  TIP 2010»
14 years 4 months ago
Variational Region-Based Segmentation Using Multiple Texture Statistics
This paper addresses variational supervised texture segmentation. The main contributions are twofold. First, the proposed method circumvents a major problem related to classical t...
Imen Karoui, Ronan Fablet, Jean-Marc Boucher, Jean...
FOGA
2007
14 years 11 months ago
Saddles and Barrier in Landscapes of Generalized Search Operators
Barrier trees are a convenient way of representing the structure of complex combinatorial landscapes over graphs. Here we generalize the concept of barrier trees to landscapes deļ...
Christoph Flamm, Ivo L. Hofacker, Bärbel M. R...