Sciweavers

1050 search results - page 19 / 210
» An approach to online optimization of heuristic coordination...
Sort
View
BROADNETS
2007
IEEE
14 years 1 months ago
Optimizing dimensionality and accelerating landmark positioning for coordinates based RTT predictions
Abstract— In this paper we analyze the positioning of landmarks in coordinates-based Internet distance prediction approaches with focus on Global Network Positioning (GNP). We sh...
Dragan Milic, Torsten Braun
GECCO
2007
Springer
142views Optimization» more  GECCO 2007»
14 years 1 months ago
Improving global numerical optimization using a search-space reduction algorithm
We have developed an algorithm for reduction of search-space, called Domain Optimization Algorithm (DOA), applied to global optimization. This approach can efficiently eliminate ...
Vinicius Veloso de Melo, Alexandre C. B. Delbem, D...
AAAI
2008
13 years 9 months ago
How Good is Almost Perfect?
Heuristic search using algorithms such as A and IDA is the prevalent method for obtaining optimal sequential solutions for classical planning tasks. Theoretical analyses of these ...
Malte Helmert, Gabriele Röger
JAIR
2008
145views more  JAIR 2008»
13 years 7 months ago
Communication-Based Decomposition Mechanisms for Decentralized MDPs
Multi-agent planning in stochastic environments can be framed formally as a decentralized Markov decision problem. Many real-life distributed problems that arise in manufacturing,...
Claudia V. Goldman, Shlomo Zilberstein
NC
2002
210views Neural Networks» more  NC 2002»
13 years 7 months ago
Recent approaches to global optimization problems through Particle Swarm Optimization
This paper presents an overview of our most recent results concerning the Particle Swarm Optimization (PSO) method. Techniques for the alleviation of local minima, and for detectin...
Konstantinos E. Parsopoulos, Michael N. Vrahatis