Boots – shoes – and leggings
Patent
1997-02-03
1999-03-23
Teska, Kevin J.
Boots, shoes, and leggings
364488, 36472501, 36472502, 36472503, 36473603, 36475402, 345427, 345154, 382276, 382277, 382280, G06F 1750, G06F 1714
Patent
active
058869026
ABSTRACT:
In a computer implemented method, possible arrangements of items, such as components to be placed on a semiconductor die, are described in a permutation space expressed as a data structure stored in a memory. The data structure is in the form of a balanced tree. In the tree, each node is a possible permutation. The ordering in the permutation space is transformed to an ordering described in a vector space using an inversion table. A best ordering of items is determined in the vector space according to a predetermined criterion such as an objective function. The best ordering as determined in vector space is then transformed back to the permutation space to determine an optimal placement of the item according to the predetermined criterion.
REFERENCES:
patent: 4156920 (1979-05-01), Winograd
patent: 5572236 (1996-11-01), Feig et al.
Pitaksononkul et al., "Bisection trees and half-quad trees: memory and time efficient data structures for VLSI layout editors", Integration, The VLSI Journal, Dec. 1, 1989, pp. 285-300.
Ramanan et al., "Permutation representation of k-ary trees", Theorectical Computer Science, vol. 38, No. 1, pp. 83-98, May 1, 1985.
Joni et al., "On restricted bases for finite fields", Combinatorial Mathematics, Optimal Designs and their Applications, a Symposium, pp. 215-217, Jan. 1, 1980.
Martin, "Transformation between tree permutations and inversion tables", ACM Eighteenths Annual Computer Science Conference Proceedings, pp. 140-146, Jan. 1, 1990.
Wu et al., "Generation of a valid loop permutation graph", Proceedings of the Sixth IASTED/ISMM International Conference: Parallel and Distributed Computing and Systems, pp. 1-3, Jan 1, 1994.
Nyberg, "On the construction of highly nonlinear permutations", Advances in Cryptology-EUROCRYPT '92: Workshop on the Theory and Applications of Cryptographic Techniques, pp. 92-98, Jan. 1, 1993.
Martin et al., "The representation and enumeration of ordered K-ary trees", computing and information: Proceedings of the International Conference, ICCI '89, pp. 105-109, Jan. 1, 1989.
Hsiao, "Nearly balanced qual list qual tree-a data structure for VLSI layout systems", VLSI Design, vol. 4, No. 1, pp. 17-32, Jan. 1, 1996.
Nandy et al., "Dual quadtree representation for VLSI designs", 23rd ACM/IEEE Design Automation Conference, pp. 663-666, Jan. 1, 1986.
Rawlings, "A binary tree decomposition space of permutation statistics", Journal of Combinatrial Theory, Series A, vol. 59, No. 1, pp. 111-124, Jan. 1, 1992.
Yuret et al., "Dynamic Hill Climbing", Al Expert, Mar. 1994, pp. 26-31.
Cooley et al., "An Algorithm for the Machine Computation of Complex Fourier Series", Mathematics of Computation, vol. 19, Apr. 1965, pp. 309-315.
Knuth, "The Art of Computer Programming", vol. 3: Sorting and Searching, Addison-Wesley, pp. 11-12, Jan. 1973.
Cooley, P.M. and J.W. Tukey, "An Algorithm for the Machine Computation of Complex Fourier Series" Mathematics of Compuation, vol. 19(Apr. 1965), pp. 309-315.
Goldberg, David, "Genetic Algorithms in Search Optimization & Machine Learning" Addison-Wesley Publishing Company, Inc. 1989 pp. 170-172, Jan. 1989.
Knuth, D.E., "The Art of Computer Programming" vol. 3: Sorting and Searching. Addison-Wesley, pp. 11-12, Jan. 1973.
Deniz Yuret and Michael De La Maza, "Dynamic Hill Climbing," article on AI Expert, Mar. 1994, pp. 26-31.
Digital Equipment Corporation
Kik Phallaka
Teska Kevin J.
LandOfFree
Method for optimizing items represented in permutation spaces does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method for optimizing items represented in permutation spaces, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for optimizing items represented in permutation spaces will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2132619