![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Minyi Li 0001
Person information
- affiliation: RMIT University, School of Science, Melbourne, VIC, Australia
- affiliation: Monash University, Melbourne, VIC, Australia
- affiliation: Swinburne University of Technology, Melbourne, VIC, Australia
Other persons with the same name
- Minyi Li 0002 — Deqing iSpatial Company Ltd., Deqing, China
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c27]Kendall Peter Taylor
, Huong Ha
, Minyi Li
, Xiaodong Li
, Jeffrey Chan
:
Accelerated Bayesian Preference Learning for Efficient Evolutionary Multi-objective Optimisation. GECCO Companion 2024: 371-374 - [i3]Ziyu Liu, Azadeh Alavi, Minyi Li, Xiang Zhang:
Self-Supervised Learning for Time Series: Contrastive or Generative? CoRR abs/2403.09809 (2024) - [i2]Ziyu Liu, Azadeh Alavi, Minyi Li, Xiang Zhang:
Guidelines for Augmentation Selection in Contrastive Learning for Time Series Classification. CoRR abs/2407.09336 (2024) - 2023
- [j9]Ziyu Liu
, Azadeh Alavi, Minyi Li, Xiang Zhang
:
Self-Supervised Contrastive Learning for Medical Time Series: A Systematic Review. Sensors 23(9): 4221 (2023) - [c26]Michael Dann, John Thangarajah, Minyi Li:
Feedback-Guided Intention Scheduling for BDI Agents. AAMAS 2023: 1173-1181 - 2022
- [j8]Sheryl Mantik
, Minyi Li
, Julie Porteous
:
A preference elicitation framework for automated planning. Expert Syst. Appl. 208: 118014 (2022) - [j7]Qinyuan Li
, Minyi Li
, Bao Quoc Vo
, Ryszard Kowalczyk
:
An efficient algorithm for task allocation with the budget constraint. Expert Syst. Appl. 210: 118279 (2022) - [c25]H. Ruda Nie, Xiuzhen Zhang, Minyi Li, Anil Dolgun:
Mitigation of Rumours in Social Networks via Epidemic Model-based Reinforcement Learning. DSAA 2022: 1-10 - 2021
- [j6]Yen-Lung Lai
, Minyi Li
, Shiuan-Ni Liang
, Zhe Jin
:
Lossless fuzzy extractor enabled secure authentication using low entropy noisy sources. J. Inf. Secur. Appl. 58: 102695 (2021) - [c24]Qinyuan Li, Minyi Li, Bao Quoc Vo, Ryszard Kowalczyk:
An anytime algorithm for dynamic multi-agent task allocation problems. ACSOS-C 2021: 249-256 - [c23]Kendall Taylor, Huong Ha, Minyi Li, Jeffrey Chan, Xiaodong Li:
Bayesian preference learning for interactive multi-objective optimisation. GECCO 2021: 466-475 - [c22]H. Ruda Nie, Xiuzhen Zhang, Minyi Li, James Baglin, Anil Dolgun:
Early Rumour Detection with Temporal Bidirectional Graph Convolutional Networks. PACIS 2021: 74 - 2020
- [j5]Qiong Tang, Zhuo Fu
, Dezhi Zhang, Hao Guo
, Minyi Li:
Addressing the Bike Repositioning Problem in Bike Sharing System: A Two-Stage Stochastic Programming Model. Sci. Program. 2020: 8868892:1-8868892:12 (2020) - [c21]H. Ruda Nie, Xiuzhen Zhang, Minyi Li, Anil Dolgun, James Baglin:
Modelling User Influence and Rumor Propagation on Twitter using Hawkes Processes. DSAA 2020: 637-646 - [c20]Qinyuan Li, Minyi Li, Bao Quoc Vo, Ryszard Kowalczyk
:
An Anytime Algorithm for Large-scale Heterogeneous Task Allocation. ICECCS 2020: 206-215 - [c19]Qinyuan Li, Minyi Li, Bao Quoc Vo, Ryszard Kowalczyk:
Distributed Near-optimal Multi-robots Coordination in Heterogeneous Task Allocation. IROS 2020: 4309-4314 - [c18]Anh Duy Nguyen, Minyi Li, Bao Quoc Vo:
Mining Conversation Data for Reward Estimation in Dialog Policy Learning. PACIS 2020: 109
2010 – 2019
- 2019
- [c17]Ming Jie Lee, Zhe Jin
, Minyi Li, Daniel Bo-Wei Chen:
Mixing Binary Face and Fingerprint based on Extended Feature Vector (EFV) Hashing. ISPACS 2019: 1-2 - 2018
- [c16]Minyi Li, Borhan Kazimipour:
An Efficient Algorithm To Compute Distance Between Lexicographic Preference Trees. IJCAI 2018: 1898-1904 - 2015
- [j4]Minyi Li
, Quoc Bao Vo, Ryszard Kowalczyk
:
Aggregating multi-valued CP-nets: a CSP-based approach. J. Heuristics 21(1): 107-140 (2015) - 2014
- [j3]Minyi Li
, Quoc Bao Vo, Ryszard Kowalczyk
:
A distributed social choice protocol for combinatorial domains. J. Heuristics 20(4): 453-481 (2014) - [j2]Minyi Li
, Quoc Bao Vo, Ryszard Kowalczyk
:
A Pareto-efficient and fair mediation approach to multilateral negotiation. Multiagent Grid Syst. 10(1): 1-22 (2014) - 2013
- [j1]Minyi Li
, Quoc Bao Vo, Ryszard Kowalczyk
, Sascha Ossowski
, Gregory E. Kersten
:
Automated negotiation in open and distributed environments. Expert Syst. Appl. 40(15): 6195-6212 (2013) - [c15]Minyi Li, Quoc Bao Vo, Ryszard Kowalczyk:
A distributed protocol for collective decision-making in combinatorial domains. AAMAS 2013: 1117-1118 - 2012
- [c14]Quoc Bao Vo, Minyi Li:
From axiomatic to strategic models of bargaining with logical beliefs and goals. AAMAS 2012: 525-532 - [c13]Quoc Bao Vo, Minyi Li
:
QoS- and Resource-Aware Service Composition and Adaptation. AMT 2012: 165-175 - [c12]Minyi Li
, Quoc Bao Vo:
Choosing Combinatorial Social Choice by Heuristic Search. ECAI 2012: 528-533 - [c11]Quoc Bao Vo, Minyi Li
:
On the Role of Expectations in Multi-agent Reasoning and Decision Making. IAT 2012: 162-169 - [c10]Wei Dong, Minyi Li
, Quoc Bao Vo, Hai Le Vu
:
Reliability in stochastic time-dependent traffic networks with correlated link travel times. ITSC 2012: 1626-1631 - [i1]Minyi Li, Quoc Bao Vo, Ryszard Kowalczyk:
An Efficient Protocol for Negotiation over Combinatorial Domains with Incomplete Information. CoRR abs/1202.3740 (2012) - 2011
- [c9]Minyi Li, Quoc Bao Vo, Ryszard Kowalczyk:
Efficient heuristic approach to dominance testing in CP-nets. AAMAS 2011: 353-360 - [c8]Minyi Li, Quoc Bao Vo, Ryszard Kowalczyk:
Majority-rule-based preference aggregation on multi-attribute domains with CP-nets. AAMAS 2011: 659-666 - [c7]Minyi Li, Quoc Bao Vo, Ryszard Kowalczyk:
Efficient penalty scoring functions for group decision-making with TCP-nets. AAMAS 2011: 1073-1074 - [c6]Minyi Li, Quoc Bao Vo, Ryszard Kowalczyk:
An Efficient Protocol for Negotiation over Combinatorial Domains with Incomplete Information. UAI 2011: 436-444 - 2010
- [c5]Minyi Li:
On efficient mediation approach to multi-issue negotiation with optimal and fair outcomes. AAMAS 2010: 1655-1656 - [c4]Minyi Li
, Quoc Bao Vo, Ryszard Kowalczyk
:
An Efficient Approach for Ordering Outcomes and Making Social Choices with CP-Nets. Australasian Conference on Artificial Intelligence 2010: 375-384 - [c3]Minyi Li, Quoc Bao Vo, Ryszard Kowalczyk:
An Efficient Procedure for Collective Decision-making with CP-nets. ECAI 2010: 375-380 - [c2]Minyi Li, Quoc Bao Vo, Ryszard Kowalczyk:
An Efficient Majority-Rule-Based Approach for Collective Decision Making with CP-Nets. KR 2010
2000 – 2009
- 2009
- [c1]Minyi Li, Quoc Bao Vo, Ryszard Kowalczyk:
Searching for fair joint gains in agent-based negotiation. AAMAS (2) 2009: 1049-1056
Coauthor Index
aka: Bao Quoc Vo
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-09-05 02:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint