Patents by Inventor Robert J. Erickson

Robert J. Erickson has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Partitioning using a correlation meta-heuristic
    Patent number: 10318690
    Abstract: A method for partitioning for a hypergraph including a plurality of nodes into a plurality of bins includes assigning each node of the hypergraph to one of the plurality of bins to generate a candidate solution, and for each pair of nodes in the candidate solution, calculating a weighted covariance based on the bin assignment of each node of the pairs of nodes in the candidate solution. The assigning and the calculating are repeated to generate an accumulated weighted covariance for the pairs of nodes, from which a seed partition of the hypergraph is generated.
    Type: Grant
    Filed: September 1, 2017
    Date of Patent: June 11, 2019
    Assignee: Synopsys, Inc.
    Inventor: Robert J. Erickson
  • Partitioning Using a Correlation Meta-Heuristic
    Publication number: 20180068044
    Abstract: A method for partitioning for a hypergraph including a plurality of nodes into a plurality of bins includes assigning each node of the hypergraph to one of the plurality of bins to generate a candidate solution, and for each pair of nodes in the candidate solution, calculating a weighted covariance based on the bin assignment of each node of the pairs of nodes in the candidate solution. The assigning and the calculating are repeated to generate an accumulated weighted covariance for the pairs of nodes, from which a seed partition of the hypergraph is generated.
    Type: Application
    Filed: September 1, 2017
    Publication date: March 8, 2018
    Applicant: Synopsys, Inc.
    Inventor: Robert J. Erickson
  • Clustering using N-dimensional placement
    Patent number: 9208278
    Abstract: A method and apparatus to cluster nodes of a hypergraph is described. The method improves the clustering by placing the hypergraph into an N-dimensional space. The method receives a design represented by a hypergraph with a plurality of nodes. The method places the plurality of nodes of the hypergraph into the N-dimensional space, where N is greater than or equal to 2. The method clusters nodes of the hypergraph based on locations of the plurality of nodes in the N-dimensional space.
    Type: Grant
    Filed: June 26, 2013
    Date of Patent: December 8, 2015
    Assignee: Synopsys, Inc.
    Inventor: Robert J. Erickson
  • CLUSTERING USING N-DIMENSIONAL PLACEMENT
    Publication number: 20150007120
    Abstract: A method and apparatus to cluster nodes of a hypergraph is described. The method improves the clustering by placing the hypergraph into an N-dimensional space. The method receives a design represented by a hypergraph with a plurality of nodes. The method places the plurality of nodes of the hypergraph into the N-dimensional space, where N is greater than or equal to 2. The method clusters nodes of the hypergraph based on locations of the plurality of nodes in the N-dimensional space.
    Type: Application
    Filed: June 26, 2013
    Publication date: January 1, 2015
    Inventor: Robert J. Erickson