1033 search results - page 30 / 207 » The Relative History Heuristic |
100
click to vote
MICRO
2000
IEEE
15 years 4 months ago
2000
IEEE
We investigate instruction distribution methods for quadcluster, dynamically-scheduled superscalar processors. We study a variety of methods with different cost, performance and c...
STACS
2004
Springer
15 years 5 months ago
2004
Springer
We consider the problem of preemptive scheduling on uniformly related machines. We present a semi-online algorithm which, if the optimal makespan is given in advance, produces an ...
DAC
2004
ACM
16 years 24 days ago
2004
ACM
A recursive algorithm for solving Boolean relations is presented. It provides several features: wide exploration of solutions, parametrizable cost function and efficiency. The exp...
118
click to vote
WEBI
2005
Springer
15 years 5 months ago
2005
Springer
Schema matching is a complex process focusing on matching between concepts describing the data in heterogeneous data sources. There is a shift from manual schema matching, done by...
IPPS
2000
IEEE
15 years 4 months ago
2000
IEEE
In order to show that the parallel co-evolution of di erent heuristic methods may lead to an e cient search strategy, we have hybridized three heuristic agents of complementary beh...