Zobrazeno 1 - 10
of 46
pro vyhledávání: '"Joseph L. Ganley"'
Autor:
Joseph L. Ganley, Lenwood S. Heath
Publikováno v:
Discrete Applied Mathematics. 109(3):215-221
A k-tree is a graph defined inductively in the following way: the complete graph Kk is a k-tree, and if G is a k-tree, then the graph resulting from adding a new vertex adjacent to k vertices inducing a Kk in G is also a k-tree. This paper examines t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::043c024ce2c38ff9233c02bc22058f25
Autor:
Joseph L. Ganley, James P. Cohoon
Publikováno v:
Integration. 27:47-56
Moat routing is the routing of nets between the input/output pads and the core circuit. In this paper, it is proved that moat routing is NP-complete under the routing model in which there are no vertical conflicts and doglegs are disallowed (i.e., ev
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ee73814c1a856cd80e8f2216543efaa9
https://doi.org/10.1016/s0167-9260(98)00015-7
https://doi.org/10.1016/s0167-9260(98)00015-7
Autor:
Lenwood S. Heath, Joseph L. Ganley
Publikováno v:
Computing. 60:121-132
A common problem that arises in many applications is to partition the vertices of a graph intok subsets, each containing a bounded number of vertices, such that the number of graph edges with endpoints in different subsets is minimized. This paper de
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d68707a97c2bfb1abbf33673d808e982
https://doi.org/10.1007/bf02684361
https://doi.org/10.1007/bf02684361
Publikováno v:
VLSI Design, Vol 7, Iss 1, Pp 97-110 (1998)
This paper presents a performance-oriented placement and routing tool for field-programmable gate arrays. Using recursive geometric partitioning for simultaneous placement and global routing, and a graph-based strategy for detailed routing, our tool
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::63c167b45d374ecb4299ab3c9349cb12
https://doaj.org/article/0fedfb13172f458da7ace633dcd2bec6
https://doaj.org/article/0fedfb13172f458da7ace633dcd2bec6
Autor:
Joseph L. Ganley
Publikováno v:
Integration. 23:151-155
Most popular tools for VLSI placement rely on some type of local search algorithm to iteratively refine a given placement solution. In such algorithms, it is necessary to evaluate the total amount of routing that a given placement will require. Typia
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::224ea1fcd29b111aa7adecd4c44d24a5
https://doi.org/10.1016/s0167-9260(97)00019-9
https://doi.org/10.1016/s0167-9260(97)00019-9
Autor:
Joseph L. Ganley, James P. Cohoon
Publikováno v:
International Journal of Computational Geometry & Applications. :457-472
This paper presents two new algorithms for computing optimal rectilinear Steiner minimal trees. The first algorithm is a simple, easily implemented dynamic programming algorithm that computes an optimal rectilinear Steiner minimal tree on n points in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::30db95557cb87303c6de1bda425ec559
https://doi.org/10.1142/s0218195997000272
https://doi.org/10.1142/s0218195997000272
Autor:
Jeffrey S. Salowe, Joseph L. Ganley
Publikováno v:
Operations Research Letters. 19:217-224
Given a set of terminals in the plane, a bottleneck Steiner tree is a tree interconnecting the terminals, in which the length of the longest edge is minimized. The bottleneck Steiner tree problem, or special cases thereof, has applications in facilit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3a28e8d01aeb926344d1cf46e6c7febf
https://doi.org/10.1016/s0167-6377(96)00028-4
https://doi.org/10.1016/s0167-6377(96)00028-4
Autor:
Joseph L. Ganley, James P. Cohoon
Publikováno v:
ACM Transactions on Design Automation of Electronic Systems. 1:512-522
The rectilinear Steiner tree problem is to find a minimum-length set of horizontal and vertical line segments that interconnect a given set of points in the plane. Here we study the thumbnail rectilinear Steiner tree problem, where the input points a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b3b2455824c16524f050505e65771bf6
https://doi.org/10.1145/238997.239033
https://doi.org/10.1145/238997.239033
Autor:
Joseph L. Ganley, Lenwood S. Heath
Publikováno v:
Computing. 52:389-405
The concept of an information graph is introduced as a representation for object-oriented databases. The retrieval layout problem is an optimization problem defined over the class of information graphs. The layout abstracts the space efficiency of re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1d2a23af40b910fd1f6943391e1f0ef8
https://doi.org/10.1007/bf02276884
https://doi.org/10.1007/bf02276884
Publikováno v:
Handbook of Algorithms for Physical Design Automation ISBN: 9780429118173
Handbook of Algorithms for Physical Design Automation
Handbook of Algorithms for Physical Design Automation
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6efb5bfafdf85467710ac8d584e83fe5
https://doi.org/10.1201/9781420013481-40
https://doi.org/10.1201/9781420013481-40
