#### Filter Results:

#### Publication Year

1982

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Data Set Used

#### Key Phrases

Learn More

- Y Takefuji, K C Lee
- Science
- 1989

A near-optimum parallel planarization algorithm is presented. The planarization algorithm, which is designed to embed a graph on a plane, uses a large number of simple processing elements called neurons. The proposed system, composed of an N x N neural network array (where N is the number of vertices), not only generates a near-maximal planar subgraph from… (More)

The authors propose the first parallel improvement algorithm using the maximum neural network model for the bipartite subgraph problem. The goal of this NP-complete problem is to remove the minimum number of edges in a given graph such that the remaining graph is a bipartite graph. A large number of instances have been simulated to verify the proposed… (More)

Multi-layer channel routing is one of cumbersome jobs in automatic layout design of VLSI chips and PCBs. As VLSI chips have been used in every field of electrical engineering , it becomes more important to reduce the layout design time. With the advancement of the VLSI technology, four-layer problems can be treated and the algorithms for more than… (More)

A system architecture and a network computational approach compatible with the goal of devising a general-purpose artificial neural network computer are described. The functionalities of supervised learning and optimization are illustrated, and cluster analysis and associative recall are briefly mentioned.<<ETX>>

The application of the Hopfield neural network for the multispectral unsupervised classification of MR images is reported. Winner-take-all neurons were used to obtain a crisp classification map using proton density-weighted and T(2)-weighted images in the head. The preliminary studies indicate that the number of iterations needed to reach ;good' solutions… (More)

A parallel and stochastic version of Hopfield-like neural networks is presented. Cauchy color noise is assumed. The specific noise is desirable for fast convergence to a fixed point representing a neighborhood minimum. It can be quickly quenched at each iteration according to a proven cooling schedule in generating random states on the energy landscape. An… (More)

A parallel algorithm for finding a near-maximum independent set in a circle graph is presented. An independent set in a graph is a set of vertices, no two of which are adjacent. A maximum independent set is an independent set whose cardinality is the largest among all independent sets of a graph. The algorithm is modified for predicting the secondary… (More)

- Foo Yoon-Pin Simon, Y. Takefuji
- IEEE 1988 International Conference on Neural…
- 1988

For Part I, see ibid., p.275-82. The authors introduce a neural computation architecture based on a stochastic Hopfield neural network model for solving job-shop scheduling. A computation circuit computes the total completion times (costs) of all jobs, and the cost difference is added to the energy function of the stochastic neural network. Using a… (More)

- Foo Yoon-Pin Simon, Y. Takefuji
- IEEE 1988 International Conference on Neural…
- 1988

An application of neural networks is presented for solving job-shop scheduling, and NP-complete optimization problem with constraint satisfaction. In particular, the authors introduce a neural computation architecture based on a stochastic Hopfield neural-network model. First, the job-shop problem is mapped into a two-dimensional matrix representation of… (More)