default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatteo Gagliolo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[c12]Matteo Gagliolo
, Tom Lenaerts, Dirk Jacobs:
Politics Matters: Dynamics of Inter-organizational Networks among Immigrant Associations. CompleNet 2014: 47-55- 2013
- [j5]Giovanni Pini, Matteo Gagliolo, Arne Brutschy, Marco Dorigo, Mauro Birattari:
Task partitioning in a robot swarm: a study on the effect of communication. Swarm Intell. 7(2-3): 173-199 (2013) - 2012
- [c11]Kevin Van Vaerenbergh, Abdel Rodríguez, Matteo Gagliolo, Peter Vrancx, Ann Nowé, Julian Stoev, Stijn Goossens, Gregory Pinte, Wim Symens:
Improving wet clutch engagement with reinforcement learning. IJCNN 2012: 1-8 - 2011
- [j4]Matteo Gagliolo, Jürgen Schmidhuber:
Algorithm portfolio selection as a bandit problem with unbounded losses. Ann. Math. Artif. Intell. 61(2): 49-86 (2011) - 2010
- [c10]Matteo Gagliolo, Jürgen Schmidhuber:
Algorithm Selection as a Bandit Problem with Unbounded Losses. LION 2010: 82-96 - [p1]Matteo Gagliolo, Catherine Legrand:
Algorithm Survival Analysis. Experimental Methods for the Analysis of Optimization Algorithms 2010: 161-184
2000 – 2009
- 2009
- [c9]Matteo Gagliolo, Catherine Legrand, Mauro Birattari:
Mixed-Effects Modeling of Optimisation Algorithm Performance. SLS 2009: 150-154 - 2008
- [c8]Matteo Gagliolo, Jürgen Schmidhuber:
Towards Distributed Algorithm Portfolios. DCAI 2008: 634-643 - [i2]Matteo Gagliolo, Jürgen Schmidhuber:
Algorithm Selection as a Bandit Problem with Unbounded Losses. CoRR abs/0807.1494 (2008) - 2007
- [j3]Jürgen Schmidhuber, Daan Wierstra, Matteo Gagliolo, Faustino J. Gomez:
Training Recurrent Networks by Evolino. Neural Comput. 19(3): 757-779 (2007) - [j2]Matteo Gagliolo:
Universal search. Scholarpedia 2(11): 2575 (2007) - [c7]Matteo Gagliolo, Jürgen Schmidhuber:
Learning Restart Strategies. IJCAI 2007: 792-797 - 2006
- [j1]Matteo Gagliolo, Jürgen Schmidhuber:
Learning dynamic algorithm portfolios. Ann. Math. Artif. Intell. 47(3-4): 295-328 (2006) - [c6]Matteo Gagliolo, Jürgen Schmidhuber:
Impact of Censored Sampling on the Performance of Restart Strategies. CP 2006: 167-181 - [c5]Jürgen Schmidhuber, Matteo Gagliolo, Daan Wierstra, Faustino J. Gomez:
Evolino for recurrent support vector machines. ESANN 2006: 593-598 - [c4]Matteo Gagliolo, Jürgen Schmidhuber:
Dynamic Algorithm Portfolios. AI&M 2006 - 2005
- [c3]Matteo Gagliolo, Jürgen Schmidhuber:
A Neural Network Model for Inter-problem Adaptive Online Time Allocation. ICANN (2) 2005: 7-12 - [i1]Jürgen Schmidhuber, Matteo Gagliolo, Daan Wierstra, Faustino J. Gomez:
Evolino for recurrent support vector machines. CoRR abs/cs/0512062 (2005) - 2004
- [c2]Matteo Gagliolo, Viktor Zhumatiy, Jürgen Schmidhuber:
Adaptive Online Time Allocation to Search Algorithms. ECML 2004: 134-143 - 2002
- [c1]Davide Anguita, Matteo Gagliolo:
MDL Based Model Selection for Relevance Vector Regression. ICANN 2002: 468-473
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 22:53 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:
