Arun Jagota

13 papers B 1Misc 1Journal 7Unranked 4
YearRankTypeTitle / Venue / Authors
2005 J jnl
Optimizing neural networks on SIMD parallel computers.
Parallel Comput.
Andrea Di Blas, Arun Jagota, Richard Hughey
2003 J jnl
A Range-Compaction Heuristic for Graph Coloring.
J. Heuristics
Andrea Di Blas, Arun Jagota, Richard Hughey
2002 J jnl
Energy function-based approaches to graph coloring.
IEEE Trans. Neural Networks
Andrea Di Blas, Arun Jagota, Richard Hughey
2001 J jnl
Adaptive, Restart, Randomized Greedy Heuristics for Maximum Clique.
J. Heuristics
Arun Jagota, Laura A. Sanchis
2000 — conf
A New Deterministic Annealing Algorithm for Maximum Clique.
IJCNN (6)
Arun Jagota, Marcello Pelillo, Anand Rangarajan
1996 Misc conf
Good Rings in Grids with Bad Nodes.
PDPTA
Brenton Chapin, Arun Jagota
1996 J jnl
Some Experimental and Theoretical Results on Test Case Generators for the Maximum Clique Problem.
INFORMS J. Comput.
Laura A. Sanchis, Arun Jagota
1995 J jnl
Approximating maximum clique with a Hopfield network.
IEEE Trans. Neural Networks
Arun Jagota
1994 J jnl
Contextual word recognition with a Hopfield-style net.
Neural Parallel Sci. Comput.
Arun Jagota
1993 — conf
Approximately solving Maximum Clique using neural network and related heuristics.
Cliques, Coloring, and Satisfiability
Arun Jagota, Laura A. Sanchis, Ravikanth Ganesan
1993 — conf
On the equivalence of two Hopfield-type networks.
ICNN
Tal Grossman, Arun Jagota
1993 — conf
Optimization by reduction to maximum clique.
ICNN
Arun Jagota
1990 B conf
Applying a Hopfield-style network to degraded text recognition.
IJCNN
Arun Jagota