Sciweavers

1050 search results - page 14 / 210
» An approach to online optimization of heuristic coordination...
Sort
View
IWCMC
2006
ACM
14 years 1 months ago
A heuristics based approach for cellular mobile network planning
Designing and planning of the switching, signaling and support network is a fairly complex process in cellular mobile network. In this paper, the problem of assigning cells to swi...
Marwan H. Abu-Amara, Sadiq M. Sait, Abdul Subhan
AAAI
2007
13 years 9 months ago
Anytime Coordination Using Separable Bilinear Programs
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...
Marek Petrik, Shlomo Zilberstein
EVOW
2007
Springer
13 years 11 months ago
Evaluating Evolutionary Algorithms and Differential Evolution for the Online Optimization of Fermentation Processes
Abstract. Although important contributions have been made in recent years within the field of bioprocess model development and validation, in many cases the utility of even relativ...
Miguel Rocha, José P. Pinto, Isabel Rocha, ...
GECCO
2007
Springer
137views Optimization» more  GECCO 2007»
14 years 1 months ago
Learning and anticipation in online dynamic optimization with evolutionary algorithms: the stochastic case
The focus of this paper is on how to design evolutionary algorithms (EAs) for solving stochastic dynamic optimization problems online, i.e. as time goes by. For a proper design, t...
Peter A. N. Bosman, Han La Poutré
PAAMS
2010
Springer
14 years 5 days ago
An UCT Approach for Anytime Agent-Based Planning
In this paper, we introduce a new heuristic search algorithm based on mean values for anytime planning, called MHSP. It consists in associating the principles of UCT, a bandit-base...
Damien Pellier, Bruno Bouzy, Marc Métivier