189 search results - page 10 / 38 » Solving Distributed Constraint Optimization Problems Using C... |
SIAMJO
2008
13 years 7 months ago
2008
We study approximations of optimization problems with probabilistic constraints in which the original distribution of the underlying random vector is replaced with an empirical dis...
PPSN
1998
Springer
13 years 11 months ago
1998
Springer
Many optimization problems require the satisfaction of constraints in addition to their objectives. When using an evolutionary algorithm to solve such problems, these constraints c...
EMMCVPR
2001
Springer
14 years 2 days ago
2001
Springer
The interest of graph matching techniques in the pattern recognition field is increasing due to the versatility of representing knowledge in the form of graphs. However, the size ...
GCC
2003
Springer
14 years 24 days ago
2003
Springer
A novel combination of genetic algorithms and constraint satisfaction modelling for the solution of two and multi-layer over-thecell channel routing problems is presented. The two ...
PPSN
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...