Marco Budinich

According to our database, Marco Budinich authored at least 12 papers between 1993 and 2019.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2019

The Boolean SATisfiability Problem in Clifford algebra.

Marco Budinich

Theor. Comput. Sci., 2019

2012

Neural Relax.

Elisa Benedetti, Marco Budinich

Neural Comput., 2012

2009

On Computational Complexity of Clifford Algebra

Marco Budinich

CoRR, 2009

2006

A Spinorial Formulation of the Maximum Clique Problem of a Graph

Marco Budinich, Paolo Budinich

CoRR, 2006

2003

Exact Bounds on the Order of the Maximum Clique of a Graph.

Marco Budinich

Discret. Appl. Math., 2003

2002

Annealed replication: a new heuristic for the maximum clique problem.

Immanuel M. Bomze, Marco Budinich, Marcello Pelillo, Claudio Rossi

Discret. Appl. Math., 2002

1999

Adaptive Calibration of Imaging Array Detectors.

Marco Budinich, Renato Frison

Neural Comput., 1999

The Maximum Clique Problem.

Immanuel M. Bomze, Marco Budinich, Panos M. Pardalos, Marcello Pelillo

Proceedings of the Handbook of Combinatorial Optimization, 1999

1996

A self-organizing neural network for the traveling salesman problem that is competitive with simulated annealing.

Marco Budinich

Neural Comput., 1996

1995

On the Ordering Conditions for Self-Organizing Maps.

Marco Budinich, John G. Taylor

Neural Comput., 1995

Sorting with self-organizing maps.

Marco Budinich

Neural Comput., 1995

1993

Some notes on perceptron learning.

Marco Budinich

Proceedings of International Conference on Neural Networks (ICNN'88), San Francisco, CA, USA, March 28, 1993