default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLiviu Panait
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c24]Zheng Xu, Maxwell D. Collins, Yuxiao Wang, Liviu Panait, Sewoong Oh, Sean Augenstein, Ting Liu, Florian Schroff, H. Brendan McMahan:
Learning to Generate Image Embeddings with User-Level Differential Privacy. CVPR 2023: 7969-7980- 2022
- [i2]Zheng Xu, Maxwell D. Collins, Yuxiao Wang, Liviu Panait, Sewoong Oh, Sean Augenstein, Ting Liu, Florian Schroff, H. Brendan McMahan:
Learning to Generate Image Embeddings with User-level Differential Privacy. CoRR abs/2211.10844 (2022) - 2021
- [c23]Quin Thames, Arjun Karpur, Wade Norris, Fangting Xia, Liviu Panait, Tobias Weyand, Jack Sim:
Nutrition5k: Towards Automatic Nutritional Understanding of Generic Food. CVPR 2021: 8903-8911 - [i1]Quin Thames, Arjun Karpur, Wade Norris, Fangting Xia, Liviu Panait, Tobias Weyand, Jack Sim:
Nutrition5k: Towards Automatic Nutritional Understanding of Generic Food. CoRR abs/2103.03375 (2021)
2010 – 2019
- 2010
- [j6]Liviu Panait:
Theoretical Convergence Guarantees for Cooperative Coevolutionary Algorithms. Evol. Comput. 18(4): 581-615 (2010)
2000 – 2009
- 2009
- [c22]Christopher Vo, Liviu Panait, Sean Luke:
Cooperative coevolution and univariate estimation of distribution algorithms. FOGA 2009: 141-150 - 2008
- [j5]Liviu Panait, Karl Tuyls
, Sean Luke:
Theoretical Advantages of Lenient Learners: An Evolutionary Game Theoretic Perspective. J. Mach. Learn. Res. 9: 423-457 (2008) - 2007
- [c21]Liviu Panait, Karl Tuyls:
Theoretical advantages of lenient Q-learners: an evolutionary game theoretic perspective. AAMAS 2007: 40 - 2006
- [j4]Sean Luke, Liviu Panait:
A Comparison of Bloat Control Methods for Genetic Programming. Evol. Comput. 14(3): 309-344 (2006) - [j3]Liviu Panait, Sean Luke, R. Paul Wiegand:
Biasing Coevolutionary Search for Optimal Multiagent Behaviors. IEEE Trans. Evol. Comput. 10(6): 629-645 (2006) - [c20]Liviu Panait, Sean Luke:
Selecting informative actions improves cooperative multiagent learning. AAMAS 2006: 760-766 - [c19]Liviu Panait, Keith Sullivan, Sean Luke:
Lenient learners in cooperative multiagent systems. AAMAS 2006: 801-803 - [c18]Keith Sullivan, Liviu Panait, Gabriel Catalin Balan, Sean Luke:
Can good learners always compensate for poor learners? AAMAS 2006: 804-806 - [c17]Liviu Panait, Sean Luke, Joseph F. Harrison:
Archive-based cooperative coevolutionary algorithms. GECCO 2006: 345-352 - 2005
- [j2]Liviu Panait, Sean Luke:
Cooperative Multi-Agent Learning: The State of the Art. Auton. Agents Multi Agent Syst. 11(3): 387-434 (2005) - [j1]Sean Luke, Claudio Cioffi-Revilla, Liviu Panait, Keith Sullivan, Gabriel Catalin Balan:
MASON: A Multiagent Simulation Environment. Simul. 81(7): 517-527 (2005) - [c16]Liviu Panait, Sean Luke:
Time-dependent Collaboration Schemes for Cooperative Coevolutionary Algorithms. AAAI Fall Symposium: Coevolutionary and Coadaptive Systems 2005: 18-25 - [c15]Sean Luke, Keith Sullivan, Liviu Panait, Gabriel Catalin Balan:
Tunably decentralized algorithms for cooperative target observation. AAMAS 2005: 911-917 - [c14]Liviu Panait:
Learning team behaviors with adaptive heterogeneity. AAMAS 2005: 1382 - [c13]Pieter Jan't Hoen, Karl Tuyls, Liviu Panait, Sean Luke, Johannes A. La Poutré:
An Overview of Cooperative and Competitive Multiagent Learning. LAMAS 2005: 1-46 - 2004
- [c12]Liviu Panait, Sean Luke:
A Pheromone-Based Utility Model for Collaborative Foraging. AAMAS 2004: 36-43 - [c11]Liviu Panait, R. Paul Wiegand, Sean Luke:
A Sensitivity Analysis of a Cooperative Coevolutionary Algorithm Biased for Optimization. GECCO (1) 2004: 573-584 - [c10]Liviu Panait, Sean Luke:
Alternative Bloat Control Methods. GECCO (2) 2004: 630-641 - [c9]Liviu Panait, R. Paul Wiegand, Sean Luke:
A Visual Demonstration of Convergence Properties of Cooperative Coevolution. PPSN 2004: 892-901 - 2003
- [c8]Sean Luke, Gabriel Catalin Balan, Liviu Panait:
Population Implosion in Genetic Programming. GECCO 2003: 1729-1739 - [c7]Liviu Panait, Sean Luke:
Methods for Evolving Robust Programs. GECCO 2003: 1740-1751 - [c6]Liviu Panait, R. Paul Wiegand, Sean Luke:
Improving Coevolutionary Search for Optimal Multiagent Behaviors. IJCAI 2003: 653-660 - 2002
- [c5]Liviu Panait, Sean Luke:
A Comparison Of Two Competitive Fitness Functions. GECCO 2002: 503-511 - [c4]Sean Luke, Liviu Panait:
Is The Perfect The Enemy Of The Good? GECCO 2002: 820-828 - [c3]Sean Luke, Liviu Panait:
Lexicographic Parsimony Pressure. GECCO 2002: 829-836 - [c2]Sean Luke, Liviu Panait:
Fighting Bloat with Nonparametric Parsimony Pressure. PPSN 2002: 411-421 - 2001
- [c1]Guido Cervone, Liviu Panait, Ryszard S. Michalski:
The Development of the AQ20 Learning System and Initial Experiments. Intelligent Information Systems 2001: 13-29
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:00 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:
