1197 search results - page 74 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
ECAI
2008
Springer
13 years 11 months ago
2008
Springer
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
GECCO
2005
Springer
14 years 2 months ago
2005
Springer
During the optimization of a constrained problem using evolutionary algorithms (EAs), an individual in the population can be described using three important properties, i.e., obje...
SGAI
2007
Springer
14 years 3 months ago
2007
Springer
Constraint Satisfaction Problems can be solved using either iterative improvement or constructive search approaches. Iterative improvement techniques converge quicker than the cons...
MP
2007
13 years 8 months ago
2007
The elastic-mode formulation of the problem of minimizing a nonlinear function subject to equilibrium constraints has appealing local properties in that, for a finite value of the...
ICASSP
2011
IEEE
13 years 1 months ago
2011
IEEE
This paper addresses the problem of beamforming (BF) design for orthogonal frequency division multiplexing (OFDM) based relay networks over frequency-selective channels. Both freq...