Остановите войну!
for scientists:
default search action
James P. Cohoon
- > Home > Persons > James P. Cohoon
Publications
- 1999
- [j10]Joseph L. Ganley, James P. Cohoon:
Provably good moat routing. Integr. 27(1): 47-56 (1999) - [c23]Worthy N. Martin, Allen L. Barker, James P. Cohoon:
Problem perturbation: implications on the fitness landscape. CEC 1999: 744-751 - 1998
- [j9]Michael J. Alexander, James P. Cohoon, Joseph L. Ganley, Gabriel Robins:
Placement and Routing for Performance-Oriented FPGA Layout. VLSI Design 7(1): 97-110 (1998) - 1997
- [j8]Joseph L. Ganley, James P. Cohoon:
Improved Computation of Optimal Rectilinear Steiner Minimal Trees. Int. J. Comput. Geom. Appl. 7(5): 457-472 (1997) - [j7]Joseph L. Ganley, James P. Cohoon:
Minimum-Congestion Hypergraph Embedding in a Cycle. IEEE Trans. Computers 46(5): 600-602 (1997) - 1996
- [j6]Joseph L. Ganley, James P. Cohoon:
Rectilinear Steiner trees on a checkerboard. ACM Trans. Design Autom. Electr. Syst. 1(4): 512-522 (1996) - [c21]Joseph L. Ganley, James P. Cohoon:
A Provably Good Moat Routing Algorithm. Great Lakes Symposium on VLSI 1996: 86-85 - 1995
- [c19]Michael J. Alexander, James P. Cohoon, Joseph L. Ganley, Gabriel Robins:
Performance-oriented placement and routing for field-programmable gate arrays. EURO-DAC 1995: 80-85 - [c18]Joseph L. Ganley, James P. Cohoon:
Thumbnail rectilinear Steiner trees. Great Lakes Symposium on VLSI 1995: 46-49 - 1994
- [c15]Joseph L. Ganley, James P. Cohoon:
Optimal Rectilinear Steiner Minimal Trees in O (n22.62n) Time. CCCG 1994: 308-313 - [c13]Michael J. Alexander, James P. Cohoon, Joseph L. Ganley, Gabriel Robins:
An architecture-independent approach to FPGA routing based on multi-weighted graphs. EURO-DAC 1994: 259-264 - [c12]Joseph L. Ganley, James P. Cohoon:
A faster dynamic programming algorithm for exact rectilinear Steiner minimal trees. Great Lakes Symposium on VLSI 1994: 238-241 - [c11]Joseph L. Ganley, James P. Cohoon:
Routing a Multi-Terminal Critical Net: Steiner Tree Construction in the Presence of Obstacles. ISCAS 1994: 113-116 - 1991
- [j5]James P. Cohoon, Shailesh U. Hegde, Worthy N. Martin, Dana S. Richards:
Distributed genetic algorithms for the floorplan design problem. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 10(4): 483-492 (1991) - [c6]James P. Cohoon, Worthy N. Martin, Dana S. Richards:
A Multi-Population Genetic Algorithm for Solving the K-Partition Problem on Hyper-Cubes. ICGA 1991: 244-248 - 1990
- [j4]James P. Cohoon, Dana S. Richards, Jeffrey S. Salowe:
An optimal Steiner tree algorithm for a net whose terminals lie on the perimeter of a rectangle. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 9(4): 398-407 (1990) - [c4]James P. Cohoon, Worthy N. Martin, Dana S. Richards:
Genetic Algorithms and Punctuated Equilibria in VLSI. PPSN 1990: 134-144 - 1988
- [j3]James P. Cohoon, Dana S. Richards:
Optimal two-terminal α-β wire routing. Integr. 6(1): 35-57 (1988) - [c3]James P. Cohoon, Dana S. Richards, Jeffrey S. Salowe:
A linear-time Steiner tree routing algorithm for terminals on the boundary of a rectangle. ICCAD 1988: 402-405 - [c2]James P. Cohoon, Shailesh U. Hegde, Worthy N. Martin, Dana Richards:
Floorplan design using distributed genetic algorithms. ICCAD 1988: 452-455 - 1987
- [c1]James P. Cohoon, Shailesh U. Hegde, Worthy N. Martin, Dana S. Richards:
Punctuated Equilibria: A Parallel Genetic Algorithm. ICGA 1987: 148-154
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-21 16:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint