Sciweavers

566 search results - page 50 / 114
» Solution Reuse in Dynamic Constraint Satisfaction Problems
Sort
View
CDC
2009
IEEE
122views Control Systems» more  CDC 2009»
14 years 10 months ago
Reduced complexity models in the identification of dynamical networks: Links with sparsification problems
In many applicative scenarios it is important to derive information about the topology and the internal connections of more dynamical systems interacting together. Examples can be ...
Donatello Materassi, Giacomo Innocenti, Laura Giar...
77
Voted
PPSN
2004
Springer
15 years 5 months ago
Dynamic Routing Problems with Fruitful Regions: Models and Evolutionary Computation
Abstract. We introduce the concept of fruitful regions in a dynamic routing context: regions that have a high potential of generating loads to be transported. The objective is to m...
Jano I. van Hemert, Johannes A. La Poutré
ATAL
2003
Springer
15 years 5 months ago
An asynchronous complete method for distributed constraint optimization
We present a new polynomial-space algorithm, called Adopt, for distributed constraint optimization (DCOP). DCOP is able to model a large class of collaboration problems in multi-a...
Pragnesh Jay Modi, Wei-Min Shen, Milind Tambe, Mak...
CEC
2009
IEEE
15 years 5 months ago
Performance of infeasibility driven evolutionary algorithm (IDEA) on constrained dynamic single objective optimization problems
Abstract—A number of population based optimization algorithms have been proposed in recent years to solve unconstrained and constrained single and multi-objective optimization pr...
Hemant K. Singh, Amitay Isaacs, Trung Thanh Nguyen...
CEC
2007
IEEE
15 years 6 months ago
An investigation into dynamic problem solving in a hybrid evolutionary market-based multi-agent system
— Static resources allocation problems have been widely studied. More recently some of this attention has changed to focus on dynamic problems, where problem specifications, con...
D. J. Cornforth