3142 search results - page 27 / 629 » Solving Hierarchical Optimization Problems Using MOEAs |
IPPS
2006
IEEE
15 years 3 months ago
2006
IEEE
We present a SAT-based approach to the task and message allocation problem of distributed real-time systems with hierarchical architectures. In contrast to the heuristic approache...
PRICAI
2004
Springer
15 years 3 months ago
2004
Springer
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Memetic algorithms have become to gain increasingly important for solving large scale combinatorial optimization problems. Typically, the extent of the application of local search...
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
Classical Evolutionary Programming (CEP) and Fast Evolutionary Programming (FEP) have been applied to realvalued function optimisation. Both of these techniques directly evolve th...
109
click to vote
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...