273 search results - page 2 / 55 » Mechanization for solving SPP by reducing order method |
IEAAIE
2001
Springer
13 years 9 months ago
2001
Springer
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
JCST
2008
13 years 5 months ago
2008
Research into ant colony algorithms for solving continuous optimization problems forms one of the most significant and promising areas in swarm computation. Although traditional an...
IPPS
2007
IEEE
13 years 11 months ago
2007
IEEE
Replicating data objects onto servers across a system can alleviate access delays. The selection of data objects and servers requires solving a constraint optimization problem, wh...
CSC
2006
13 years 6 months ago
2006
: - There are many numerical methods adopted to solve mathematical problems. Early researchers focused on the methods to reduce computational costs. In recent years, reduction in c...
GECCO
2006
Springer
13 years 9 months ago
2006
Springer
In this paper, we propose a dynamic mechanism to vary the probability by which fitness inheritance is applied throughout the run of a multi-objective particle swarm optimizer, in ...