Zobrazeno 1 - 10
of 198
pro vyhledávání: '"Wilson, Nic"'
Preference Inference involves inferring additional user preferences from elicited or observed preferences, based on assumptions regarding the form of the user's preference relation. In this paper we consider a situation in which alternatives have an
Externí odkaz:
http://arxiv.org/abs/2409.11044
Autor:
Prestwich, Steven, Wilson, Nic
Publikováno v:
In International Journal of Approximate Reasoning August 2024 171
Autor:
Montazery, Mojtaba, Wilson, Nic
Publikováno v:
In International Journal of Approximate Reasoning January 2021 128:69-101
Autor:
Wilson, Nic, Marinescu, Radu
Publikováno v:
In International Journal of Approximate Reasoning October 2020 125:73-117
Autor:
Jeansoulin, Robert, Wilson, Nic
The objective is to present one important aspect of the European IST-FET project "REV!GIS"1: the methodology which has been developed for the translation (interpretation) of the quality of the data into a "fitness for use" information, that we can co
Externí odkaz:
http://arxiv.org/abs/1401.6679
Publikováno v:
Journal Of Artificial Intelligence Research, Volume 38, pages 271-305, 2010
Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a feature subscription involves choosing and sequencing features from a catalogue and
Externí odkaz:
http://arxiv.org/abs/1401.3842
Publikováno v:
Journal Of Artificial Intelligence Research, Volume 33, pages 403-432, 2008
We investigate the computational complexity of testing dominance and consistency in CP-nets. Previously, the complexity of dominance has been determined for restricted classes in which the dependency graph of the CP-net is acyclic. However, there are
Externí odkaz:
http://arxiv.org/abs/1401.3453
Autor:
Wilson, Nic
This paper describes a natural framework for rules, based on belief functions, which includes a repre- sentation of numerical rules, default rules and rules allowing and rules not allowing contraposition. In particular it justifies the use of the Dem
Externí odkaz:
http://arxiv.org/abs/1304.1134
Autor:
Wilson, Nic
A very computationally-efficient Monte-Carlo algorithm for the calculation of Dempster-Shafer belief is described. If Bel is the combination using Dempster's Rule of belief functions Bel, ..., Bel,7, then, for subset b of the frame C), Bel(b) can be
Externí odkaz:
http://arxiv.org/abs/1303.5757
Autor:
Wilson, Nic
This paper examines the concept of a combination rule for belief functions. It is shown that two fairly simple and apparently reasonable assumptions determine Dempster's rule, giving a new justification for it.
Comment: Appears in Proceedings of
Comment: Appears in Proceedings of
Externí odkaz:
http://arxiv.org/abs/1303.1518