Sciweavers

15073 search results - page 274 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
AE
2001
Springer
15 years 9 months ago
Markov Random Field Modelling of Royal Road Genetic Algorithms
Abstract. Markov Random Fields (MRFs) 5] are a class of probabalistic models that have been applied for many years to the analysis of visual patterns or textures. In this paper, ou...
Deryck F. Brown, A. Beatriz Garmendia-Doval, John ...
FMOODS
2007
15 years 6 months ago
Formal Modeling and Analysis of the OGDC Wireless Sensor Network Algorithm in Real-Time Maude
This paper describes the application of Real-Time Maude to the formal specification, simulation, and further formal analysis of the sophisticated state-of-the-art OGDC wireless se...
Peter Csaba Ölveczky, Stian Thorvaldsen
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
15 years 10 months ago
Convergence of stochastic search algorithms to gap-free pareto front approximations
Recently, a convergence proof of stochastic search algorithms toward finite size Pareto set approximations of continuous multi-objective optimization problems has been given. The...
Oliver Schütze, Marco Laumanns, Emilia Tantar...
CEC
2005
IEEE
15 years 10 months ago
Evolutionary algorithm for noun phrase detection in natural language processing
Noun phrases of a document usually are the main information bearers. Thus, the detection of these units is crucial in many applications related to information retrieval, such as co...
Jose Ignacio Serrano, Lourdes Araujo
ICASSP
2008
IEEE
15 years 11 months ago
Unsupervised optimal phoneme segmentation: Objectives, algorithm and comparisons
Phoneme segmentation is a fundamental problem in many speech recognition and synthesis studies. Unsupervised phoneme segmentation assumes no knowledge on linguistic contents and a...
Yu Qiao, Naoya Shimomura, Nobuaki Minematsu