2310 search results - page 100 / 462 » The selection efficiency of tournaments |
DATE
1998
IEEE
14 years 1 months ago
1998
IEEE
In this paper, we present an approach to synthesize multiple behavior modules. Given n DFGs to be implemented, the previous methods scheduled each of them sequentially, and implem...
ESTIMEDIA
2006
Springer
14 years 21 days ago
2006
Springer
Efficient and deadlock-free routing is critical to the performance of networks-on-chip. In this paper we present an approach that can be coupled to any adaptive routing algorithm ...
GECCO
2006
Springer
14 years 21 days ago
2006
Springer
Evolutionary algorithms tend to produce solutions that are not evolvable: Although current fitness may be high, further search is impeded as the effects of mutation and crossover ...
DIS
2008
Springer
13 years 10 months ago
2008
Springer
We propose a well-founded method of ranking a pool of m trained classifiers by their suitability for the current input of n instances. It can be used when dynamically selecting a s...
CGF
2008
13 years 9 months ago
2008
Given a 3D solid model S represented by a tetrahedral mesh, we describe a novel algorithm to compute a hierarchy of convex polyhedra that tightly enclose S. The hierarchy can be b...