Marco Protasi

Publication Activity (10 Years)

Years Active: 1975-2001
Publications (10 Years): 0

Publications

Roberto Battiti, Marco Protasi
Reactive Local Search for the Maximum Clique Problem. Algorithmica 29 (4) (2001)
Roberto Battiti, Marco Protasi
Reactive Local Search Techniques for the Maximum k-conjunctive Constraint Satisfaction Problem (MAX-k-CCSP). Discret. Appl. Math. (1999)
Roberto Battiti, Marco Protasi
Reactive Search, a History-Sensitive Heuristic for MAX-SAT. ACM J. Exp. Algorithmics 2 (1997)
Monica Bianchini, Stefano Fanelli, Marco Gori, Marco Protasi
Solving Linear Systems by a Neural Network Canonical Form of Efficient Gradient Descent. ICONIP (1) (1997)
Paolo Frasconi, Marco Gori, Stefano Fanelli, Marco Protasi
Suspiciousness of loading problems. ICNN (1997)
Roberto Battiti, Marco Protasi
Reactive Local Search for Maximum Clique. WAE (1997)
Giorgio Gambosi, Marco Protasi, Maurizio Talamo
Preserving Approximation in the Min-Weighted Set Cover Problem. Discret. Appl. Math. 73 (1) (1997)
Roberto Battiti, Marco Protasi
Solving MAX-SAT with non-oblivious functions and history-based heuristics. Satisfiability Problem: Theory and Applications (1996)
M. Di Martino, Stefano Fanelli, Marco Protasi
Exploring and comparing the best "direct methods" for the efficient training of MLP-networks. IEEE Trans. Neural Networks 7 (6) (1996)
Giorgio Ausiello, Marco Protasi
Local Search, Reducibility and Approximability of NP-Optimization Problems. Inf. Process. Lett. 54 (2) (1995)
Giorgio Ausiello, Pierluigi Crescenzi, Marco Protasi
Approximate Solution of NP Optimization Problems. Theor. Comput. Sci. 150 (1) (1995)
Ludek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi
On Learning Monotone DNF Formulae under Uniform Distributions Inf. Comput. 110 (1) (1994)
Michele Angelaccio, Marco Protasi
Limiting Characterizations of Low Level Space Complexity Classes. RAIRO Theor. Informatics Appl. 27 (3) (1993)
Giorgio Gambosi, Marco Protasi, Maurizio Talamo
An Efficient Implicit Data Structure for Relation Testing and Searching in Partially Ordered Sets. BIT 33 (1) (1993)
S. Fanelli, M. Di Martino, Marco Protasi
An efficient algorithm for the binary classification of patterns using MLP-networks. ICNN (1993)
Giorgio Ausiello, Marco Protasi
Limiting Polynomial Approximation of Complexity Classes. Int. J. Found. Comput. Sci. 1 (2) (1990)
Marco Protasi, Maurizio Talamo
On the Number of Arithmetical Operations for Finding Fibonacci Numbers. Theor. Comput. Sci. 64 (1) (1989)
Giorgio Gambosi, Marco Protasi, Maurizio Talamo
An Efficient Implicit Data Structure for Path Testing and Searching in Rooted Trees and Forests. FSTTCS (1989)
Alberto Marchetti-Spaccamela, Marco Protasi
Learning Under Uniform Distribution. FCT (1989)
Ludek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi
On the Learnability of DNF Formulae. ICALP (1988)
Marco Protasi, Maurizio Talamo
A Parametric Analysis of the Largest Induced Tree Problem in Random Graphs. RAIRO Theor. Informatics Appl. 20 (3) (1986)
Ludek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi, Maurizio Talamo
Near Optimal Algorithms for Finding Minimum Steiner Trees on Random Graphs. MFCS (1986)
Marco Protasi, Maurizio Talamo
On the Maximum Size of Random Trees. TAPSOFT, Vol.1 (1985)
Alberto Marchetti-Spaccamela, Marco Protasi
The Largest Tree in a Random Graph. Theor. Comput. Sci. 23 (1983)
Giorgio Ausiello, Marco Protasi, Maurizio Talamo
Probabilistic Models for Database Schemes and Random Hypergraphs. WG (1983)
Marco Protasi, Maurizio Talamo
A New Probabilistic Model for the Study of Algorithmic Properties of Random Graph Problems. FCT (1983)
Giorgio Ausiello, Alberto Marchetti-Spaccamela, Marco Protasi
Probabilistic Analysis of the Performance of Greedy Strategies over Different Classes of Combinatorial Problems. FCT (1981)
Giorgio Ausiello, Alessandro D'Atri, Marco Protasi
Lattice theoretic ordering properties for NP-complete optimization problems. Fundam. Informaticae 4 (1) (1981)
Giorgio Ausiello, Alberto Marchetti-Spaccamela, Marco Protasi
Full Approximatibility of a Class of Problems over Power Sets. CAAP (1981)
Giorgio Ausiello, Alberto Marchetti-Spaccamela, Marco Protasi
Toward a Unified Approach for the Classification of NP-Complete Optimization Problems. Theor. Comput. Sci. 12 (1980)
Giorgio Ausiello, Alessandro D'Atri, Marco Protasi
Structure Preserving Reductions among Convex Optimization Problems. J. Comput. Syst. Sci. 21 (1) (1980)
Giorgio Ausiello, Alessandro D'Atri, Marco Protasi
On the Structure of Combinatorial Problems and Structure Preserving Reductions. ICALP (1977)
Giorgio Ausiello, Alessandro D'Atri, Marco Gaudiano, Marco Protasi
Classes of Structurally Isomorphic {NP}-Optimization Problems. MFCS (1977)
Giorgio Ausiello, Marco Protasi
On the Comparison of Notions of Approximation. MFCS (1975)