Marco Protasi

According to our database, Marco Protasi authored at least 35 papers between 1975 and 2001.

Collaborative distances:

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

2001

Reactive Local Search for the Maximum Clique Problem.

Roberto Battiti, Marco Protasi

Algorithmica, 2001

1999

Reactive Local Search Techniques for the Maximum k-conjunctive Constraint Satisfaction Problem (MAX-k-CCSP).

Roberto Battiti, Marco Protasi

Discret. Appl. Math., 1999

Complexity and approximation: combinatorial optimization problems and their approximability properties.

Giorgio Ausiello, Alberto Marchetti-Spaccamela, Pierluigi Crescenzi, Giorgio Gambosi, Marco Protasi, Viggo Kann

Springer, ISBN: 3540654313, 1999

1997

Reactive Search, a History-Sensitive Heuristic for MAX-SAT.

Roberto Battiti, Marco Protasi

ACM J. Exp. Algorithmics, 1997

Preserving Approximation in the Min-Weighted Set Cover Problem.

Giorgio Gambosi, Marco Protasi, Maurizio Talamo

Discret. Appl. Math., 1997

Reactive Local Search for Maximum Clique.

Roberto Battiti, Marco Protasi

Proceedings of the Workshop on Algorithm Engineering, 1997

Solving Linear Systems by a Neural Network Canonical Form of Efficient Gradient Descent.

Monica Bianchini, Stefano Fanelli, Marco Gori, Marco Protasi

Proceedings of the Progress in Connectionist-Based Information Systems: Proceedings of the 1997 International Conference on Neural Information Processing and Intelligent Information Systems, 1997

Suspiciousness of loading problems.

Paolo Frasconi, Marco Gori, Stefano Fanelli, Marco Protasi

Proceedings of International Conference on Neural Networks (ICNN'97), 1997

1996

Exploring and comparing the best "direct methods" for the efficient training of MLP-networks.

M. Di Martino, Stefano Fanelli, Marco Protasi

IEEE Trans. Neural Networks, 1996

Solving MAX-SAT with non-oblivious functions and history-based heuristics.

Roberto Battiti, Marco Protasi

Proceedings of the Satisfiability Problem: Theory and Applications, 1996

1995

Approximate Solution of NP Optimization Problems.

Giorgio Ausiello, Pierluigi Crescenzi, Marco Protasi

Theor. Comput. Sci., 1995

Local Search, Reducibility and Approximability of NP-Optimization Problems.

Giorgio Ausiello, Marco Protasi

Inf. Process. Lett., 1995

1994

On Learning Monotone DNF Formulae under Uniform Distributions

Ludek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi

Inf. Comput., April, 1994

1993

Limiting Characterizations of Low Level Space Complexity Classes.

Michele Angelaccio, Marco Protasi

RAIRO Theor. Informatics Appl., 1993

An Efficient Implicit Data Structure for Relation Testing and Searching in Partially Ordered Sets.

Giorgio Gambosi, Marco Protasi, Maurizio Talamo

BIT, 1993

An efficient algorithm for the binary classification of patterns using MLP-networks.

S. Fanelli, M. Di Martino, Marco Protasi

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

1990

Limiting Polynomial Approximation of Complexity Classes.

Giorgio Ausiello, Marco Protasi

Int. J. Found. Comput. Sci., 1990

1989

On the Number of Arithmetical Operations for Finding Fibonacci Numbers.

Marco Protasi, Maurizio Talamo

Theor. Comput. Sci., 1989

An Efficient Implicit Data Structure for Path Testing and Searching in Rooted Trees and Forests.

Giorgio Gambosi, Marco Protasi, Maurizio Talamo

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1989

Learning Under Uniform Distribution.

Alberto Marchetti-Spaccamela, Marco Protasi

Proceedings of the Fundamentals of Computation Theory, 1989

1988

On the Learnability of DNF Formulae.

Ludek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi

Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

1986

A Parametric Analysis of the Largest Induced Tree Problem in Random Graphs.

Marco Protasi, Maurizio Talamo

RAIRO Theor. Informatics Appl., 1986

Near Optimal Algorithms for Finding Minimum Steiner Trees on Random Graphs.

Ludek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi, Maurizio Talamo

Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

1985

On the Maximum Size of Random Trees.

Marco Protasi, Maurizio Talamo

Proceedings of the Mathematical Foundations of Software Development, 1985

1983

The Largest Tree in a Random Graph.

Alberto Marchetti-Spaccamela, Marco Protasi

Theor. Comput. Sci., 1983

Probabilistic Models for Database Schemes and Random Hypergraphs.

Giorgio Ausiello, Marco Protasi, Maurizio Talamo

Proceedings of the WG '83, 1983

A New Probabilistic Model for the Study of Algorithmic Properties of Random Graph Problems.

Marco Protasi, Maurizio Talamo

Proceedings of the Fundamentals of Computation Theory, 1983

1981

Lattice theoretic ordering properties for NP-complete optimization problems.

Giorgio Ausiello, Alessandro D'Atri, Marco Protasi

Fundam. Informaticae, 1981

Probabilistic Analysis of the Performance of Greedy Strategies over Different Classes of Combinatorial Problems.

Giorgio Ausiello, Alberto Marchetti-Spaccamela, Marco Protasi

Proceedings of the Fundamentals of Computation Theory, 1981

Full Approximatibility of a Class of Problems over Power Sets.

Giorgio Ausiello, Alberto Marchetti-Spaccamela, Marco Protasi

Proceedings of the CAAP '81, 1981

1980

Toward a Unified Approach for the Classification of NP-Complete Optimization Problems.

Giorgio Ausiello, Alberto Marchetti-Spaccamela, Marco Protasi

Theor. Comput. Sci., 1980

Structure Preserving Reductions among Convex Optimization Problems.

Giorgio Ausiello, Alessandro D'Atri, Marco Protasi

J. Comput. Syst. Sci., 1980

1977

Classes of Structurally Isomorphic {NP}-Optimization Problems.

Giorgio Ausiello, Alessandro D'Atri, Marco Gaudiano, Marco Protasi

Proceedings of the Mathematical Foundations of Computer Science 1977, 1977

On the Structure of Combinatorial Problems and Structure Preserving Reductions.

Giorgio Ausiello, Alessandro D'Atri, Marco Protasi

Proceedings of the Automata, 1977

1975

On the Comparison of Notions of Approximation.

Giorgio Ausiello, Marco Protasi

Proceedings of the Mathematical Foundations of Computer Science 1975, 1975