M. P. Fourman, "Compaction of symbolic layout using genetic algorithm," in Proc. 2nd Int. COnf. Genetic Algorithms, 1985, pp. 141--153.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....information provides to the judgement of a human decision maker with the trade offs to establish interactions between different criteria, hence simplifying the decision process to choose an acceptable range of solutions for a multicriteria problem. Implemented first by Schaffer [36,37] Fourman [38] and then by Kursawe, 39,40] and others, cooperative population searches (CPS) with criterion selection [41] was used to build the Pareto front in selected multicriteria problems. The central idea in CPS is to make a parallel single criterion search, where all members of the population of an ....

M.P. Fourman, Compaction of symbolic layout using genetic algorithm, in: J.J. Grefenstette (Ed.), Proceedings of the First International Conference on Genetic Algorithms 1985, pp. 141-153.

....nonevolutionary approaches to EHW. Finally, Section VI concludes this paper with a summary of the paper and some remarks. II. EVOLUTIONARY DESIGN OF ELECTRONIC CIRCUITS Although EHW is a relatively new term, evolutionary design of electronic circuits have been attempted for more than a decade [8] [10] These early attempts did not design the architecture or function of a circuit. They were only used to optimize certain aspects of electronic circuit boards, e.g. cell placement [9] 10] and compaction of symbolic layout [8] In essence, such work is better described as combinatorial ....

....of electronic circuits have been attempted for more than a decade [8] 10] These early attempts did not design the architecture or function of a circuit. They were only used to optimize certain aspects of electronic circuit boards, e.g. cell placement [9] 10] and compaction of symbolic layout [8]. In essence, such work is better described as combinatorial optimization by EA s. Recent EHW work concentrates on evolutionary design of electronic circuits, although the ultimate goal is to develop online adaptive hardware. So far, few studies have been reported on EHW, which adapts its ....

M. P. Fourman, "Compaction of symbolic layout using genetic algorithms, " in Proc. 1st Int. Conf. Genetic Algorithms Their Applicat.,J.J. Grefenstette, Ed. Pittsburgh, PA: Carnegie Mellon Univ. Press, 1985, pp. 141--153.

....disjoint feasible spaces, noisy function evaluation, etc. evolutionary approach (e.g. a genetic algorithm) may be applied. Probably the first ideas concerning application of evolutionary algorithms to multicriteria optimisation problems came from independent work of Schaffer [14] and Fourman [7]. In the first case (VEGA Vector Evaluated Genetic Algorithm) selection was realised in separate sub populations on the basis of particular objective functions, while variation operators were applied to the whole population. In the second case selection was based on a tournament, where the ....

M. P. Fourman. Compaction of symbolic layout using genetic algorithms. In Grefenstette [9].

....used to minimize the objective function. Genetic al gorithms (GAs) 59] provide a powerful and domain independent search method for complex, poorly understood search spaces. Genetic algorithms have been applied to a wide diversity of problems such as combinatorial optimization [60] VLSI layout [61], machine learning [62] scene recognition [63] and adaptive image segmentation [9] In our earlier work [41] 42] we presented preliminary results for a new application of genetic algorithms in 3D data registration. The details about the theory and the implementation of the genetic algorithm ....

M.P. Fourman, Compaction of Symbolic Layout Using Genetic Algorithms, Proc. of Int. Conf. of Genetic Algorithms and their Applications, pp. 141-153, July 1985. 91

....3.4 Compaction As mentioned in Section 2, compaction transforms the symbolic layout to a mask layout with the goal of minimizing the size of the resulting circuit layout. To the best of our knowledge, the only application of a genetic algorithm for compaction has been advanced by Fourman [14]. He describes two prototypes of genetic algorithms that perform compaction of a symbolic circuit layout. Although his results are limited to very simple layout structures, he does propose a new problem specific representation for layout design that includes constraints of the compaction process. ....

M. P. Fourman, "Compaction of Symbolic Layout using Genetic Algorithms," Proc. of the First International Conference on Genetic Algorithms, pp. 141153, 1985.

.... two dimensional algorithms (compaction in x and y direction simultaneously) and topological algorithms (moving of separate cells according to routing constraints) To the best of our knowledge, the only applications of an evolutionary algorithm for compaction have been advanced by two papers: [Fourman (1985)] and [Goodman et al. 1994) In a related paper, Hsieh et al. 1988) makes use of similar principles to apply the technique of simulated annealing to the compaction problem. In the rst of these, Fourman (1985) describes two prototypes of genetic algorithms that perform compaction of a ....

....of an evolutionary algorithm for compaction have been advanced by two papers: Fourman (1985) and [Goodman et al. 1994) In a related paper, Hsieh et al. 1988) makes use of similar principles to apply the technique of simulated annealing to the compaction problem. In the rst of these, [Fourman (1985)] describes two prototypes of genetic algorithms that perform compaction of a symbolic circuit layout. The algorithm considers symbolic placement and routing results which are characterized by their routing requirements and the technological constraints. These designs are encoded into ....

[Article contains additional citation context not shown here]

Fourman M.P., Compaction of Symbolic Layout using Genetic Algorithms, Proc. of the First International Conference on Genetic Algorithms, 1985, pp. 141-153.

....final step in the physical layout design of VLSI circuits to transform the symbolic layout to a mask layout with the goal of minimizing the size of the resulting circuit layout. To the best of our knowledge, the only application of a genetic algorithm for compaction has been advanced by Fourman [10]. He describes two prototypes of genetic algorithms which perform compaction of a symbolic circuit layout. Although his results are limited to very simple layout structures, he proposes a new problem specific representation for layout design that includes constraints of the compaction process. 4 ....

M. P. Fourman, "Compaction of Symbolic Layout using Genetic Algorithms," Proc. of the First International 1985.

....d importance des objectifs. Plusieurs m etaheuristiques a base de populations ont et e utilis ees pour r esoudre des PMO en se basant sur la s election lexicographique : ffl Algorithmes g en etiques : Fourman a propos e une m ethode de s election bas ee sur l ordre lexicographique dans un AG [26]. La s election est r ealis ee en comparant des paires d individus ; chaque paire d individus est compar ee suivant l objectif avec la plus grande priorit e. Si le r esultat est le meme pour cet objectif, alors l objectif avec la deuxi eme priorit e est utilis e, etc. Comme dans l algorithme VEGA, ....

M. P. Fourman. Compaction of symbolic layout using genetic algorithms. In J. J. Grefenstette, editor, Int. Conf. on Genetic Algorithms and their Applications, pages 141--153, Pittsburgh, 1985.

....front in a single optimization run. The numerous applications and the rapidly growing interest in the area of multiobjective EAs take this fact into account. After the first pioneering studies on evolutionary multiobjective optimization appeared in the mid eighties (Schaffer, 1984, 1985; Fourman,1985) several different EA implementations were proposed in the years 1991 1994 (Kursawe, 1991; Hajela and Lin, 1992; Fonseca c fl2000 by the Massachusetts Institute of Technology Evolutionary Computation 8(2) 173 195 E. Zitzler, K. Deb, and L. Thiele and Fleming, 1993; Horn et al. 1994; Srinivas ....

Fourman, M. P. (1985). Compaction of symbolic layout using genetic algorithms. In Grefenstette, J. J., editor, Proceedings of an International Conference on Genetic Algorithms and Their Applications, pages 141--153, sponsored by Texas Instruments and U.S. Navy Center for Applied Research in Artificial Intelligence (NCARAI).

....[30] Faccenda, J. F. 87] Falkenauer, Emanuel, 195, 69] Fang, Hsiao Lan, 196, 197, 233] Fennel, Theron Randy, 146] Ferris, Michael C. 9, 14] File, P. E. 267, 276] Filipic, Bogdan, 114, 198, 199] Fogarty, Terence C. 79, 91] Forrest, Stephanie, 271, 272] Fourman, Michael P. [35, 36] Fox, B. R. 273] Fox, Geoffrey C. 200] Fujita, Kikuo, 37] Fukuda, T. 212] Fuquay, D Ann, 261] Furuhashi, Takeshi, 13, 259, 260] Fwa, T. F. 115, 140] Gabbert, Paula S. 190] Gen, Mitsua, 280] Gen, Mitsuo, 111, 117, 147, 149, 151, 201] Germay, Noel, 202] 14 Gerys, D. ....

.... [34] MasPar, 60] Prolog, 91] Smalltalk 80, 88] transputers, 229, 254, 167] 18 initial population, 213] instruction scheduling, 177, 134] interactive, 52] job shop problem, 225, 128] job shop scheduling, 232, 264, 112, 113, 117, 142, 147, 149, 152] JSS, 161] layout design, [45, 46, 35, 36, 39, 49, 33, 55, 42, 58, 34, 48, 56, 59, 61, 67, 40, 43, 44, 47, 52, 53, 57, 62, 63, 54, 64, 65, 66, 21, 22, 23, 24, 74, 28, 31] layout design area optimization, 26] dynamic, 29] facility, 68, 32] FMS, 75] networks, 38, 51] shop job, 88] VLSI, 27] learning, 236] line balancing, 69, 80] linear transportation problem, 291] load balancing, 130, 79] logistics, 163] machine learning, 223, 81, 71] ....

[Article contains additional citation context not shown here]

Michael P. Fourman. Compaction of symbolic layout using genetic algorithms. In Grefenstette [296], pages 141--153. ga:Fourman85a.

....reason, VEGA can, at least in some cases, maintain di#erent species for many more generations than a GA optimizing a pure weighted sum of the same objectives with fixed weights would, due to genetic drift. Unfortunately, the balance reached necessarily depends on the scaling of the objectives. Fourman (1985) also addressed multiple objectives in a non aggregating manner. Selection was performed by comparing pairs of individuals, each pair according to one of the objectives. In a first version of the algorithm, objectives were assigned di#erent priorities by the user and individuals compared according ....

Fourman, M. P. (1985). Compaction of symbolic layout using genetic algorithms. In (Grefenstette, 1985), pages 141--153.

....G. 188] Eyvazova, Z. E. 60] Fabbricatore, P. 461] Falco, I. De, 288] Fang, W. Eugene, 246] Finley, Linda, 376] Fiorito, N. 311] Fisher, G. 408] Fisher, M. H. 47] Fleming, Peter, 69] Fogarty, Terence C. 64] Fogel, David B. 210] Fong, N. H. B. 315] Fourman, Michael P. [409, 410] Frazer, J. H. 316] Freeman, L. M. 141] Fridshal, D. 405] Friedrich, Ch. M. 392] Friedrich, M. 120] Fuat Uler, Gokce, 477] Fujimoto, Yoshiji, 357] Fujita, Kikuo, 411] Furuhashi, Takeshi, 28] Furuta, H. 317, 324, 123] Furuya, Hiroshi, 112] Gage, P. J. 116] Gage, Peter J. ....

.... [131] Hypercube, 105] MasPar, 444] MIMD, 395, 217] Occam, 368] Pascal, 461] Smalltalk 80, 456] transputer, 361, 368] transputers, 395] interactive, 433] interactive GA, 65] interval arithmetics, 351] inverse problems aerodynamic, 465, 486] laminates, 92, 55] layout design, [419, 420, 409, 410, 414, 103, 437, 417, 443, 105, 424, 160, 181, 185, 455, 416, 130, 418, 422, 433, 154, 169, 450, 451, 155, 452, 453, 199, 213, 16, 222, 18, 241, 34, 281, 284, 302, 341, 348, 382] layout design area optimization, 235] dynamic, 262] facility, 457, 291, 340] FMS, 247] nesting, 356] networks, 412, 431] petroleum site, 367] shop job, 456] VLSI, 427, 428, 240, 384] layout design , 309, 346] logic, 17] LSI design, 290] machine learning, 131, 482] macro cell ....

[Article contains additional citation context not shown here]

Michael P. Fourman. Compaction of symbolic layout using genetic algorithms. In John J. Grefenstette, editor, Proceedings of the First International Conference on Genetic Algorithms and Their Applications, pages 141--153, Pittsburgh, PA, 24. - 26. July 1985. Lawrence Erlbaum Associates: Hillsdale, New Jersey. ga:Fourman85a.

....front in a single optimization run. The numerous applications and the rapidly growing interest in the area of multiobjective EAs take this fact into account. After the rst pioneering studies on evolutionary multiobjective optimization appeared in the mid eighties (Scha er 1984; Scha er 1985; Fourman 1985), a couple of di erent EA implementations were proposed in the years 1991 1994 (Kursawe 1991; Hajela and Lin 1992; Fonseca and Fleming 1993; Horn, Nafpliotis, and Goldberg 1994; Srinivas and Deb 1994) Later, these approaches (and variations of them) were successfully applied to various ....

Fourman, M. P. (1985). Compaction of symbolic layout using genetic algorithms. In J. J. Grefenstette (Ed.), Proceedings of an International Conference on Genetic Algorithms and Their Applications, Pittsburgh, PA, pp. 141-153. sponsored by Texas Instruments and U.S. Navy Center for Applied Research in Articial Intelligence (NCARAI).

....of concave trade off surfaces, the population tended to split into species particularly strong in each of the objectives. This can be understood by noting that points in concave regions of the trade off cannot be found by optimizing a linear combination of the objectives, for any set of weights. Fourman (1985) also addressed multiple objectives in a non aggregating manner. Selection was performed by comparing pairs of individuals, each pair according to one of the objectives. In a first version of the algorithm, objectives were assigned different priorities by the user and individuals compared ....

Fourman, M. P. (1985). Compaction of symbolic layout using genetic algorithms. In (Grefenstette, 1985), pages 141--153.

....computer software deterministically computing an MOP s Pareto front at a given computational resolution. 1 Introduction Multiobjective Evolutionary Algorithms (MOEAs) are now a well established field within Evolutionary Computation. They were born in 1985 when Schaffer [16] and Fourman [6] implemented the first MOEAs dealing with Multiobjective Optimization Problems (MOPs) Since then, over 140 published papers propose various MOEA implementations and applications, and to a much lesser extent, underlying MOEA theory [19] Many of these efforts use numeric MOPs as examples to show ....

Fourman, Michael P. "Compaction of Symbolic Layout Using Genetic Algorithms." In Grefenstette [9], 141-- 153.

....k objectives have been considered. The ith problem is given by Minimize f i (x) 31) subject to g j (x) 0; j = 1; 2; m (32) f l (x) f l ; l = 1; 2; i Gamma 1 (33) The solution obtained at the end, i.e. x k is taken as the desired solution x of the problem. Applications Fourman [1985] suggested a selection scheme based on lexicographic ordering. In a first version of his algorithm, objectives were assigned different priorities by the user and each pair of individuals were compared according to the objective with the highest priority. If this resulted in a tie, the objective ....

Fourman, M. P. 1985. Compaction of symbolic layout using genetic algorithms. In Genetic Algorithms and their Applications: Proceedings of the First International Conference on Genetic Algorithms (1985), pp. 141--153. Lawrence Erlbaum.

....is sensitive to the non convexity of Pareto sets. In fact, points located in concave sections of the tradeoff surface cannot be generated by optimizing weighted linear combinations of the objectives [ Fonseca and Fleming, 1995 ] Another class of multiobjective EAs [ Schaffer, 1985 ] Fourman, 1985 ] does not aggregate the objectives into a single scalar but changes between objectives. Schaffer s VEGA [ Schaffer, 1984 ] Schaffer, 1985 ] selects for each objective separately a fraction of the population according to this particular objective. Fourman [ Fourman, 1985 ] implemented a selection ....

....EAs [ Schaffer, 1985 ] Fourman, 1985 ] does not aggregate the objectives into a single scalar but changes between objectives. Schaffer s VEGA [ Schaffer, 1984 ] Schaffer, 1985 ] selects for each objective separately a fraction of the population according to this particular objective. Fourman [ Fourman, 1985 ] implemented a selection scheme where individuals are compared with regard to a specific (or random) order of the objectives. This kind of fitness assignment is often also sensitive to concave Pareto fronts [ Fonseca and Fleming, 1995 ] Pareto based fitness was proposed by Goldberg [ Goldberg, ....

Michael P. Fourman. Compaction of symbolic layout using genetic algorithms. In John J. Grefenstette, editor, Proceedings of an International Conference on Genetic Algorithms and Their Applications, pages 141--153, 1985.

....in a single optimization run. The numerous applications and the rapidly growing interest in the area of multiobjective EAs take this fact into account. After the first pioneering studies on evolutionary multiobjective optimization appeared in the mid eighties (Schaffer 1984; Schaffer 1985; Fourman 1985), a couple of different EA implementations were proposed in the years 1991 1994 (Kursawe 1991; Hajela and Lin 1992; Fonseca and Fleming 1993; Horn, Nafpliotis, and Goldberg 1994; Srinivas and Deb 1994) Later, these approaches (and variations of them) were successfully applied to various ....

Fourman, M. P. (1985). Compaction of symbolic layout using genetic algorithms. In J. J. Grefenstette (Ed.), Proceedings of an International Conference on Genetic Algorithms and Their Applications, pp. 141--153.

....The basic idea of this technique is that the designer ranks the objectives in order of importance. The optimum solution is then found by minimizing the objective functions, starting with the most important one and proceeding according to the order of importance of the objectives [47] Fourman [18] suggested a selection scheme based on lexicographic ordering. In a first version of his algorithm, objectives were assigned different priorities by the user and each pair of individuals were compared according to the objective with the highest priority. If this resulted in a tie, the objective ....

M. P. Fourman. Compaction of symbolic layout using genetic algorithms. In Genetic Algorithms and their Applications: Proceedings of the First International Conference on Genetic Algorithms, pages 141--153. Lawrence Erlbaum, 1985.

....and help to automate geometrical design [2,3] The translation of the output of the detailed routing phase into mask data must convert the circuit elements into the appropriate mask features. At the same time, it should ensure that all design rules are met, while minimizing the layout area. In [78], a genetic algorithm for performing the compaction is described. A population consisting of lists of constraints is used with chromosomes differing with respect to the order in which these constraints are applied. We will describe this problem and GA s for it in more details in the next section. ....

....generation to last generation, will form the final layout of the packing. 2.5.4. Compaction Problem formulation. Minimize the area of the layout, while preserving the design rules and not altering the function of the circuit; both x and y coordinates of elements can be changed simultaneously. In [78], the genetic algorithm evolves populations of strings, the length of which is not fixed. New individuals are produced by a stochastic mix of the classical genetic operators [4 6] crossover, mutation and inversion. The layout problem may be thought of as a form of 2 D binpacking [78] A ....

[Article contains additional citation context not shown here]

M.Fourman, "Compaction of Symbolic Layout using Genetic Algorithms," in Proc. 1st Int. Conf. on Genetic Algorithms and their Applications, July, 1985, pp. 141-153.

No context found.

M. P. Fourman, "Compaction of symbolic layout using genetic algorithm," in Proc. 2nd Int. COnf. Genetic Algorithms, 1985, pp. 141--153.

No context found.

M. P. Fourman. Compaction of symbolic layout using genetic algorithms. In Genetic Algorithms and their Applications: Proceedings of the First International Conference on Genetic Algorithms, pages 141-153. Lawrence Erlbaum, 1985.

No context found.

Fourman M. P., "Compaction of symbolic layout using genetic algorithms," presented at 1st Int. Conference on Genetic Algorithms, Pittsburgh, 1985.

No context found.

M. Fourman,\Compaction of Symbolic Layout Using Genetic Algorithms", Proc. 1st Int. Conf. on Genetic Algorithms, pp.141-153, Jul. 1985.

No context found.

Fourman, M.P., "Compaction of Symbolic Layout Using Genetic Algorithms", In J.J. Grefenstette (ed.), Genetic Algorithms and Their Applications: Proceedings of the First International Conference on Genetic Algorithms, (pp. 141-153), Hillsdale, NJ: Lawrence Erlbaum, 1985

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC