Sciweavers

481 search results - page 35 / 97
» Anytime Local Search for Distributed Constraint Optimization
Sort
View
105
Voted
UAI
2000
14 years 11 months ago
Exploiting Qualitative Knowledge in the Learning of Conditional Probabilities of Bayesian Networks
Algorithms for learning the conditional probabilities of Bayesian networks with hidden variables typically operate within a high-dimensional search space and yield only locally op...
Frank Wittig, Anthony Jameson
AROBOTS
2002
126views more  AROBOTS 2002»
14 years 10 months ago
Selecting Landmarks for Localization in Natural Terrain
We describe techniques to optimally select landmarks for performing mobile robot localization by matching terrain maps. The method is based upon a maximum-likelihood robot localiza...
Clark F. Olson
CODES
2001
IEEE
15 years 1 months ago
Hybrid global/local search strategies for dynamic voltage scaling in embedded multiprocessors
In this paper, we explore a hybrid global/local search optimization framework for dynamic voltage scaling in embedded multiprocessor systems. The problem is to find, for a multipr...
Neal K. Bambha, Shuvra S. Bhattacharyya, Jürg...
GECCO
2008
Springer
180views Optimization» more  GECCO 2008»
14 years 11 months ago
An agent-based collaborative evolutionary model for multimodal optimization
A novel approach to multimodal optimization called Roaming Agent-Based Collaborative Evolutionary Model (RACE) combining several evolutionary techniques with agent-based modeling ...
Rodica Ioana Lung, Camelia Chira, Dumitru Dumitres...
ATAL
2010
Springer
14 years 11 months ago
Improving DPOP with function filtering
DPOP is an algorithm for distributed constraint optimization which has, as main drawback, the exponential size of some of its messages. Recently, some algorithms for distributed c...
Ismel Brito, Pedro Meseguer