Sciweavers

1576 search results - page 291 / 316
» Properties of Synthetic Optimization Problems
Sort
View
ENTCS
2007
121views more  ENTCS 2007»
13 years 9 months ago
Incremental Parametric Development of Greedy Algorithms
The event B method provides a general framework for modelling both data structures and algorithms. B models are validated by discharging proof obligations ensuring safety properti...
Dominique Cansell, Dominique Méry
PR
2006
119views more  PR 2006»
13 years 9 months ago
Fingerprint matching by genetic algorithms
Fingerprint matching is still a challenging problem for reliable person authentication because of the complex distortions involved in two impressions of the same finger. In this p...
Xuejun Tan, Bir Bhanu
AICOM
2005
91views more  AICOM 2005»
13 years 9 months ago
Multiagent systems for cardiac pacing simulation and control
Abstract. Simulating and controlling physiological phenomena are complex tasks to tackle. This is due to the fact that physiological processes are usually described by a set of par...
Francesco Amigoni, Alessandro Beda, Nicola Gatti
TASLP
2008
102views more  TASLP 2008»
13 years 9 months ago
Acoustic Source Separation of Convolutive Mixtures Based on Intensity Vector Statistics
Various techniques have previously been proposed for the separation of convolutive mixtures. These techniques can be classified as stochastic, adaptive, and deterministic. Stochast...
Banu Gunel, Hüseyin Hacihabiboglu, Ahmet M. K...
ML
2000
ACM
244views Machine Learning» more  ML 2000»
13 years 9 months ago
Learnable Evolution Model: Evolutionary Processes Guided by Machine Learning
A new class of evolutionary computation processes is presented, called Learnable Evolution Model or LEM. In contrast to Darwinian-type evolution that relies on mutation, recombinat...
Ryszard S. Michalski