Sciweavers

4007 search results - page 334 / 802
» Computation with imprecise probabilities
Sort
View
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
16 years 1 months ago
Learned mutation strategies in genetic programming for evolution and adaptation of simulated snakebot
In this work we propose an approach of incorporating learned mutation strategies (LMS) in genetic programming (GP) employed for evolution and adaptation of locomotion gaits of sim...
Ivan Tanev
GECCO
2005
Springer
150views Optimization» more  GECCO 2005»
16 years 1 months ago
Population-based incremental learning with memory scheme for changing environments
In recent years there has been a growing interest in studying evolutionary algorithms for dynamic optimization problems due to its importance in real world applications. Several a...
Shengxiang Yang
MFCS
2005
Springer
16 years 1 months ago
Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
Julia Böttcher
208
Voted
SEMWEB
2005
Springer
16 years 1 months ago
A Bayesian Network Approach to Ontology Mapping
This paper presents our ongoing effort on developing a principled methodology for automatic ontology mapping based on BayesOWL, a probabilistic framework we developed for modeling ...
Rong Pan, Zhongli Ding, Yang Yu, Yun Peng
211
Voted
CONCUR
2004
Springer
16 years 28 days ago
Probabilistic Event Structures and Domains
Abstract. This paper studies how to adjoin probability to event structures, leading to the model of probabilistic event structures. In their simplest form probabilistic choice is l...
Daniele Varacca, Hagen Völzer, Glynn Winskel