Zobrazeno 1 - 10
of 36
pro vyhledávání: '"Maria Silvia Pini"'
Publikováno v:
Algorithms, Vol 6, Iss 4, Pp 782-804 (2013)
The stable matching problem (also known as the stable marriage problem) is a well-known problem of matching men to women, so that no man and woman, who are not married to each other, both prefer each other. Such a problem has a wide variety of practi
Externí odkaz:
https://doaj.org/article/495950181c694f31b606234c3039a3c2
Publikováno v:
Algorithms, Vol 6, Iss 4, Pp 591-617 (2013)
The stable marriage (SM) problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools or, more generally, to any two-sided market. In the classical formulation, n men and n
Externí odkaz:
https://doaj.org/article/f74deac969b64c94a5b09f5bcca76083
Publikováno v:
Autonomous Agents and Multi-Agent Systems
First published online: 21 May 2021 In many machine learning scenarios, looking for the best classifier that fits a particular dataset can be very costly in terms of time and resources. Moreover, it can require deep knowledge of the specific domain.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a744be6a96bcf438066308de73ba8394
http://hdl.handle.net/11379/550940
http://hdl.handle.net/11379/550940
Publikováno v:
Blockchain
Proof of Work (PoW) is the consensus protocol introduced with Bitcoin, and is still one of the most used protocols, thanks to its security properties. However, it is very expensive in terms of energy consumption. For this reason, many other protocols
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d4c570c83691f4022a2fab0e439c9027
https://doi.org/10.1109/blockchain50366.2020.00065
https://doi.org/10.1109/blockchain50366.2020.00065
Publikováno v:
AI 2019: Advances in Artificial Intelligence ISBN: 9783030352875
Australasian Conference on Artificial Intelligence
Australasian Conference on Artificial Intelligence
Although recommender systems have been significantly developed for providing customized services to users in various domains, they still have some limitations regarding the extraction of users’ conditional preferences from their past selections whe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a8cb4634edf4ea6b1dd1bbc9f5361d5b
https://doi.org/10.1007/978-3-030-35288-2_11
https://doi.org/10.1007/978-3-030-35288-2_11
We consider scenarios where several agents must aggregate their preferences over a large set of candidates with a combinatorial structure. That is, each candidate is an element of the Cartesian product of the domains of some variables (i.e., features
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f7d164fe774db3699d7518ab7f7be8a3
http://hdl.handle.net/11577/3287328
http://hdl.handle.net/11577/3287328
Publikováno v:
FUSION
An Abstract Argumentation Framework (AAF) is an abstract structure consisting of a set arguments, whose origin, nature, and possible internal organisation is not specified, and by a binary relation of attack on the set of arguments, whose meaning is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6d8f63fe07374089f7055fa67cd02dad
https://doi.org/10.23919/icif.2018.8455455
https://doi.org/10.23919/icif.2018.8455455
Publikováno v:
AI*IA 2018 – Advances in Artificial Intelligence ISBN: 9783030038397
AI*IA
AI*IA
The stable matching problem has many practical applications in two-sided markets, like those that assign doctors to hospitals or students to schools. Usually it is assumed that all agents in each side explicitly express a preference ordering over tho
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::711e9e331031e11d19afdefd4677faef
https://doi.org/10.1007/978-3-030-03840-3_16
https://doi.org/10.1007/978-3-030-03840-3_16
Publikováno v:
Algorithms, Vol 6, Iss 4, Pp 782-804 (2013)
Algorithms
Volume 6
Issue 4
Pages 782-804
Algorithms
Volume 6
Issue 4
Pages 782-804
The stable matching problem (also known as the stable marriage problem) is a well-known problem of matching men to women, so that no man and woman, who are not married to each other, both prefer each other. Such a problem has a wide variety of practi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e5bbb6baddf765aade8211dca38f5ecd
http://www.mdpi.com/1999-4893/6/4/782
http://www.mdpi.com/1999-4893/6/4/782
Publikováno v:
Algorithms; Volume 6; Issue 4; Pages: 591-617
Algorithms, Vol 6, Iss 4, Pp 591-617 (2013)
Algorithms, Vol 6, Iss 4, Pp 591-617 (2013)
The stable marriage (SM) problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools or, more generally, to any two-sided market. In the classical formulation, n men and n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8078a1b1656493e7656c6c77567bd9d8
https://doi.org/10.3390/a6040591
https://doi.org/10.3390/a6040591