Algorithms for hierarchical power
โ Scribed by Mitali De; Keith W. Hipel; D. Marc Kilgour
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 895 KB
- Volume
- 39
- Category
- Article
- ISSN
- 0096-3003
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Consider a hierarchical network in which each node periodically issues a request for an object drawn from a fixed set of unit-size objects. Suppose further that the following conditions are satisfied: the frequency with which each node accesses each object is known; each node has a cache of known ca
We prove upper and lower bounds on performance guarantees of approximation ลฝ . algorithms for the hierarchical MAX-SAT H-MAX-SAT problem. This problem is representative of a broad class of PSPACE-hard problems involving graphs, Boolean formulas, and other structures that are defined succinctly. Our
Genetic algorithm behavior is determined by the explorationrexploitation balance kept throughout the run. When this balance is disproportionate, the premature convergence problem will probably appear, causing a drop in the genetic algorithm's efficacy. One approach presented for dealing with this pr
## Abstract This paper presents unequal microstrip power divider designs using the hierarchal genetic algorithm (HGA). The dividing ratio and return loss are the design specifications leading the evolution direction. By employing the HGA chromosome formulation, the system structure and its associat