241 search results - page 3 / 49 » Constraint Handling in Genetic Algorithms: The Set Partition... |
VLSID
2006
IEEE
14 years 1 months ago
2006
IEEE
Design space exploration is central to embedded system design. Typically this is a multi-objective search problem, where performance, power, area etc. are the different optimizati...
AUSAI
2003
Springer
14 years 22 days ago
2003
Springer
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...
CEC
2005
IEEE
14 years 1 months ago
2005
IEEE
Abstract- This paper presents a new operator for genetic algorithms that enhances their convergence in the case of nonlinear problems with nonlinear equality constraints. The propo...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
This paper describes a Genetic Algorithms approach to a manpower-scheduling problem arising at a major UK hospital. Although Genetic Algorithms have been successfully used for sim...
VLSID
2002
IEEE
14 years 7 months ago
2002
IEEE
In this paper, we present a functional partitioning method for low power real-time distributed embedded systems whose constituent nodes are systems-on-a-chip (SOCs). The systemlev...