default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefano Fanelli
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2005
[j8]Carmine Di Fiore, Stefano Fanelli, Paolo Zellini:
Low-complexity minimization algorithms. Numer. Linear Algebra Appl. 12(8): 755-768 (2005)- 2004
- [c4]Carmine Di Fiore, Stefano Fanelli, Paolo Zellini:
An Efficient Generalization of Battiti-Shanno's Quasi-Newton Algorithm for Learning in MLP-Networks. ICONIP 2004: 483-488 - 2003
- [j7]Carmine Di Fiore, Stefano Fanelli, Filomena Lepore, Paolo Zellini:
Matrix algebras in Quasi-Newton methods for unconstrained minimization. Numerische Mathematik 94(3): 479-500 (2003) - [j6]Alessandro Bortoletti, Carmine Di Fiore, Stefano Fanelli, Paolo Zellini:
A new class of quasi-Newtonian methods for optimal learning in MLP-networks. IEEE Trans. Neural Networks 14(2): 263-273 (2003) - 2001
- [j5]Monica Bianchini
, Stefano Fanelli, Marco Gori:
Optimal Algorithms for Well-Conditioned Nonlinear Systems of Equations. IEEE Trans. Computers 50(7): 689-698 (2001)
1990 – 1999
- 1998
- [c3]Monica Bianchini, Stefano Fanelli, Marco Gori:
An Application of ELISA to Perfect Hashing with Deterministic Ordering. ICONIP 1998: 1126-1129 - 1997
- [j4]Monica Bianchini, Stefano Fanelli, Marco Gori, Marco Maggini:
Terminal attractor algorithms: A critical analysis. Neurocomputing 15(1): 3-13 (1997) - [c2]Paolo Frasconi, Marco Gori, Stefano Fanelli, Marco Protasi:
Suspiciousness of loading problems. ICNN 1997: 1240-1245 - [c1]Monica Bianchini, Stefano Fanelli, Marco Gori, Marco Protasi:
Solving Linear Systems by a Neural Network Canonical Form of Efficient Gradient Descent. ICONIP (1) 1997: 531-534 - 1996
- [j3]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): 1497-1502 (1996)
1980 – 1989
- 1981
- [j2]Stefano Fanelli:
An unresolved conjecture on nonmaximal planar graphical sequences. Discret. Math. 36(1): 109-112 (1981) - 1980
- [j1]Stefano Fanelli:
On a conjecture on maximal planar sequences. J. Graph Theory 4(4): 371-375 (1980)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
