1984 search results - page 86 / 397 » The colourful feasibility problem |
IJCNN
2006
IEEE
14 years 4 months ago
2006
IEEE
— Job-shop scheduling is one of the most difficult production scheduling problems in industry. This paper proposes an adaptive neural network and local search hybrid approach fo...
CEC
2005
IEEE
14 years 3 months ago
2005
IEEE
We present a homomorphous mapping that converts problems with linear equality constraints into fully unconstrained and lower-dimensional problems for optimization with PSO. This ap...
RE
1999
Springer
14 years 2 months ago
1999
Springer
One of the difficulties in requirements negotiation is to determine a feasible and mutually satisfactory set of requirements for the developer and the user, a problem related to C...
TEC
2010
13 years 4 months ago
2010
A new algorithm for solving MAX-SAT problems is introduced which clusters good solutions, and restarts the search from the closest feasible solution to the centroid of each cluster...
ROBIO
2006
IEEE
14 years 4 months ago
2006
IEEE
— The architecture optimization of a three degrees of freedom (3-DOF) planar cable-driven parallel manipulator (CDPM) with multiple objectives has been implemented by means of GA...