146 search results - page 23 / 30 » Optimally Solving the MCM Problem Using Pseudo-Boolean Satis... |
ASPDAC
2008
ACM
14 years 11 months ago
2008
ACM
Nowadays many customised embedded processors offer the possibility of speeding up an application by implementing it using Application-Specific Functional units (AFUs). However, th...
85
Voted
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
A genetic algorithm encoding is proposed which is able to automatically satisfy a class of important cardinality constraints where the set of distinct values of the design variabl...
ATAL
2007
Springer
15 years 3 months ago
2007
Springer
Coalition formation is an important form of interaction in multiagent systems. It enables the agents to satisfy tasks that they would otherwise be unable to perform, or would perf...
FLAIRS
2008
14 years 12 months ago
2008
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...
103
click to vote
GECCO
2000
Springer
15 years 1 months ago
2000
Springer
This paper presents a genetic algorithm based method to solve the capacity and routing assignment problem arising in the design of selfhealing networks using the Virtual Path (VP)...