default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAntoine Rolland
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Keisuke Maekawa
, Tomoya Nakashita, Toki Yoshioka, Takashi Hori, Antoine Rolland, Tadao Nagatsuma:
Single-channel 240-Gbit/s sub-THz wireless communications using ultra-low phase noise receiver. IEICE Electron. Express 21(3): 20230584 (2024)- [j5]Antoine Rolland, Jean-Baptiste Aubin, Irène Gannaz, Samuela Leoni:
Probabilistic models of profiles for voting by evaluation. Soc. Choice Welf. 63(2): 377-400 (2024) - 2023
- [c7]Keisuke Maekawa, Yuma Kawamoto, Tomoya Nakashita, Toki Yoshioka, Takashi Hori, Brendan M. Heffernan, James Greenberg, Rubab Amin, Tatsuya Tanigawa, Antoine Rolland, Tadao Nagatsuma:
300-GHz-band Wireless Link Using Photonics-based Ultralow-noise Transmitter and Receiver. OFC 2023: 1-3 - 2022
- [j4]Alexandru-Liviu Olteanu, Khaled Belahcène, Vincent Mousseau, Wassila Ouerdane, Antoine Rolland, Jun Zheng:
Preference elicitation for a ranking method based on multiple reference profiles. 4OR 20(1): 63-84 (2022) - [j3]Jean-Baptiste Aubin, Irène Gannaz, Samuela Leoni, Antoine Rolland:
Deepest voting: A new way of electing. Math. Soc. Sci. 116: 1-16 (2022) - 2021
- [i1]Antoine Rolland, Jean-Baptiste Aubin, Irène Gannaz, Samuela Leoni:
A Note on Data Simulations for Voting by Evaluation. CoRR abs/2104.07666 (2021)
2010 – 2019
- 2014
- [c6]Thibaut Lust, Antoine Rolland:
2-additive Choquet Optimal Solutions in Multiobjective Optimization Problems. IPMU (1) 2014: 256-265 - 2013
- [j2]Thibaut Lust, Antoine Rolland:
Choquet optimal set in biobjective combinatorial optimization. Comput. Oper. Res. 40(10): 2260-2269 (2013) - [j1]Antoine Rolland:
Reference-based preferences aggregation procedures in multi-criteria decision making. Eur. J. Oper. Res. 225(3): 479-486 (2013) - [c5]Julien Ah-Pine, Brice Mayag, Antoine Rolland:
Identification of a 2-Additive Bi-Capacity by Using Mathematical Programming. ADT 2013: 15-29 - [c4]Thibaut Lust, Antoine Rolland:
On the Computation of Choquet Optimal Solutions in Multicriteria Decision Contexts. MIWAI 2013: 131-142 - 2012
- [c3]Brice Mayag, Antoine Rolland, Julien Ah-Pine:
Elicitation of a 2-Additive Bi-capacity through Cardinal Information on Trinary Actions. IPMU (4) 2012: 238-247 - 2011
- [c2]Antoine Rolland, Goulc'hen Loas, Ludovic Frein, Marc Vallet, Marc Brunel, Mehdi Alouini:
Optoelectronic down conversion: A novel approach for optical beat note stabilisation up to the THz domain. ICAIT 2011: 1-3
2000 – 2009
- 2008
- [b1]Antoine Rolland:
Procedures d'agregation ordinale de preferences avec points de reference pour l'aide a la decision. (Ordinal preferences aggregation rules with reference points for decision aiding). Pierre and Marie Curie University, Paris, France, 2008 - 2006
- [c1]Patrice Perny, Antoine Rolland:
Reference-Dependent Qualitative Models for Decision Making Under Uncertainty. ECAI 2006: 422-426
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-10-07 22:13 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:
