1033 search results - page 71 / 207 » The Relative History Heuristic |
86
Voted
GECCO
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. In this paper, we propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. The algorithm includes a local op...
AE
2007
Springer
15 years 6 months ago
2007
Springer
The evaluation or fitness function is a key component of any heuristic search algorithm. This paper introduces a new evaluation function for the well-known graph K-coloring proble...
BIOWIRE
2007
Springer
15 years 6 months ago
2007
Springer
Abstract—One of the challenges in a military wireless sensor network is the determination of an information collection infrastructure which minimizes battery power consumption. T...
105
click to vote
ECWEB
2007
Springer
15 years 6 months ago
2007
Springer
Service matchmaking is the process of finding appropriate services for a given set of requirements. We present a novel service matchmaking approach based on the internal process o...
IPPS
2006
IEEE
15 years 6 months ago
2006
IEEE
This paper presents an efficient modeling scheme and a partitioning heuristic for parallelizing VLSI post-placement timing optimization. Encoding the paths with timing violations...