Neural network solution to the link scheduling problem using convex relaxation
- 4 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Graph partitioning using annealed neural networksIEEE Transactions on Neural Networks, 1990
- Fast TSP algorithm based on binary neuron output and analog neuron input using the zero-diagonal interconnect matrix and necessary and sufficient constraints of the permutation matrixPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- Average case analysis of Greedy algorithms for Kelly's triangle problem and the independent set problemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- Absolute Stability of Global Pattern Formation and Parallel Memory Storage by Competitive Neural NetworksPublished by Elsevier ,1987
- “Neural” computation of decisions in optimization problemsBiological Cybernetics, 1985
- Neurons with graded response have collective computational properties like those of two-state neurons.Proceedings of the National Academy of Sciences, 1984