Arun Jagota

According to our database1, Arun Jagota authored at least 13 papers between 1990 and 2005.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2005
Optimizing neural networks on SIMD parallel computers.
Parallel Comput., 2005

2003
A Range-Compaction Heuristic for Graph Coloring.
J. Heuristics, 2003

2002
Energy function-based approaches to graph coloring.
IEEE Trans. Neural Networks, 2002

2001
Adaptive, Restart, Randomized Greedy Heuristics for Maximum Clique.
J. Heuristics, 2001

2000
A New Deterministic Annealing Algorithm for Maximum Clique.
Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks, 2000

1996
Some Experimental and Theoretical Results on Test Case Generators for the Maximum Clique Problem.
INFORMS J. Comput., 1996

Good Rings in Grids with Bad Nodes.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1996

1995
Approximating maximum clique with a Hopfield network.
IEEE Trans. Neural Networks, 1995

1994
Contextual word recognition with a Hopfield-style net.
Neural Parallel Sci. Comput., 1994

1993
Optimization by reduction to maximum clique.
Proceedings of International Conference on Neural Networks (ICNN'88), San Francisco, CA, USA, March 28, 1993

On the equivalence of two Hopfield-type networks.
Proceedings of International Conference on Neural Networks (ICNN'88), San Francisco, CA, USA, March 28, 1993

Approximately solving Maximum Clique using neural network and related heuristics.
Proceedings of the Cliques, 1993

1990
Applying a Hopfield-style network to degraded text recognition.
Proceedings of the IJCNN 1990, 1990


  Loading...