References of "Bisdorff, Raymond 50000801"
     in
Bookmark and Share    
Full Text
See detailAlgorithmic Decision Theory: Lecture notes and presentation slides
Bisdorff, Raymond UL

Learning material (2019)

The objective of this course is to introduce students to ADT, a new interdisciplinary field at the intersection of decision theory, discrete mathematics, theoretical computer science and artificial ... [more ▼]

The objective of this course is to introduce students to ADT, a new interdisciplinary field at the intersection of decision theory, discrete mathematics, theoretical computer science and artificial intelligence. ADT proposes new ideas, approaches and tools for supporting decision making processes in presence of massive databases, combinatorial structures, partial and/or uncertain information, and distributed, possibly inter-operating, decision makers. Such problems arise in several real-world decision making problems such as humanitarian logistics, epidemiology, risk assessment and management, e-government, electronic commerce, and the implementation of recommender systems [less ▲]

Detailed reference viewed: 44 (2 UL)
Full Text
See detailTutorials for using the Digraph3 Python software collection
Bisdorff, Raymond UL

Textual, factual or bibliographical database (2018)

The documentation contains a set of tutorials introducing the main objects like digraphs, outranking digraphs and performance tableaux. There is also a tutorial provided on undirected graphs. Some ... [more ▼]

The documentation contains a set of tutorials introducing the main objects like digraphs, outranking digraphs and performance tableaux. There is also a tutorial provided on undirected graphs. Some tutorials are problem oriented and show how to compute the winner of an election, how to build a best choice recommendation, or how to linearly rank with multiple incommensurable ranking criteria. A last tutorial illustrates how to compute non isomorphic maximal independent sets in the n-cycle graph. [less ▲]

Detailed reference viewed: 49 (4 UL)
Full Text
See detailComputational Statistics: Lecture notes and presentation slides
Bisdorff, Raymond UL

Learning material (2018)

The objective of this course is to introduce the students to the R language and environment for statistical computing and graphics (a GNU project). In particular, the course proposes effective data ... [more ▼]

The objective of this course is to introduce the students to the R language and environment for statistical computing and graphics (a GNU project). In particular, the course proposes effective data handling and storage solutions as well as useful operators for calculations on arrays, in particular matrices. A selected collection of intermediate tools for data analysis, graphical facilities for data analysis and display either on-screen or on hard copy will be illustrated from examples of statistical analyses. Finally, the course will by the way acquaint the students with a well-developed, simple and effective programming language which includes conditionals, loops, user-defined recursive functions and input and output facilities. [less ▲]

Detailed reference viewed: 32 (4 UL)
Full Text
See detailUL HPC users'session: Mastering big data
Bisdorff, Raymond UL

Presentation (2018, June 13)

We illustrate in this presentation an optimized HPC implementation for outranking digraphs of huge orders, up to several millions of decision alternatives. The proposed outranking digraph model is based ... [more ▼]

We illustrate in this presentation an optimized HPC implementation for outranking digraphs of huge orders, up to several millions of decision alternatives. The proposed outranking digraph model is based on a quantiles equivalence class decomposition of the underlying multicriteria performance tableau. When locally ranking each of these ordered components, we may readily obtain an overall linear ranking of big sets of decision alternatives. The proposed optimization strategies tackles algorithmic refinements of the ranking algorithm, reducing the size of python data objects, typing the data for efficient cython and C compilation, efficient sharing of static data via global python variables, using a multiprocessing task queue, and, last but not least, use the efficient UL HPC equipements. [less ▲]

Detailed reference viewed: 22 (2 UL)
Full Text
See detailAlgorithmic Decision Theory for solving complex decision problems
Bisdorff, Raymond UL

Presentation (2017, May 03)

Today's decision makers in fields ranging from engineering to psychology, from medicine to economics and/or homeland security are faced with remarkable new technologies, huge amounts of information to ... [more ▼]

Today's decision makers in fields ranging from engineering to psychology, from medicine to economics and/or homeland security are faced with remarkable new technologies, huge amounts of information to help them in reaching good decisions, and the ability to share information at unprecedented speeds and quantities. These tools and resources should lead to better decisions. Yet, the tools bring with them daunting new problems: the massive amounts of data available are often incomplete, unreliable and/or distributed and there is great uncertainty in them; interoperating/distributed decision makers and decision making devices need to be coordinated; many sources of data need to be fused into a good decision; information sharing under new cooperation/competition arrangements raises security problems. When faced with such issues, there are few highly efficient algorithms available to support decision makers. The objective of Algorithmic Decision Theory (ADT) is to improve the ability of decision makers to perform well when facing these new challenges and problems through the use of methods from theoretical computer science, in particular algorithmic methods. The primary goal of ADT is hence to explore and develop algorithmic approaches for solving decision problems arising in a variety of applications areas. Examples include, but are not limited to: - Computational tractability/intractability of social consensus and multiple criteria compromise functions; - Improvement of decision support and recommender systems; - Development of automatic decision devices including on-line decision procedures; - Robust decision making; - Learning for multi-agent systems and other on-line decision devices. This presentation will focus more specifically on multiple criteria decision aiding methodology, the actual research field of the author. [less ▲]

Detailed reference viewed: 48 (7 UL)
Full Text
Peer Reviewed
See detailComputing linear rankings from trillions of pairwise outranking situations
Bisdorff, Raymond UL

Scientific Conference (2016, November)

We present in this paper a sparse HPC implementation for outranking digraphs of huge orders, up to several millions of decision alternatives. The proposed outranking digraph model is based on a quantiles ... [more ▼]

We present in this paper a sparse HPC implementation for outranking digraphs of huge orders, up to several millions of decision alternatives. The proposed outranking digraph model is based on a quantiles equivalence class decomposition of the underlying multicriteria performance tableau. When locally ranking each of these ordered components, we may readily obtain an overall linear ranking of big sets of decision alternatives. For the local rankings, both, Copeland's as well as the Net-Flows ranking rules, appear to give the best compromise between, on the one side, the fitness of the overall ranking with respect to the given global outranking relation and, on the other side, computational tractability for very big outranking digraphs modelling up to several trillions of pairwise outranking situations. [less ▲]

Detailed reference viewed: 47 (10 UL)
Full Text
Peer Reviewed
See detailA sparse outranking digraph model for HPC-ranking of big performance tableaux
Bisdorff, Raymond UL

Scientific Conference (2016, July 05)

In the context of the ongoing GDRI-Algodec "Algorithmic Decision Theory", supported o.a. by the CNRS (France) and the FNR (Luxembourg), we develop multicriteria ranking HPC algorithms for large sets of ... [more ▼]

In the context of the ongoing GDRI-Algodec "Algorithmic Decision Theory", supported o.a. by the CNRS (France) and the FNR (Luxembourg), we develop multicriteria ranking HPC algorithms for large sets of potential decision alternatives: up to several thousand of alternatives evaluated on multiple incommensurable ordinal performance criteria. By using Python3.5 multiprocessing resources and the Digraph3 multicriteria software library, we could linearly rank without ties on the UL HPC gaia-80 machine with 120 single threaded cores and a CPU memory of 2.3 TB, in about four hours (6h05') a huge set of 1'732'051 decision alternatives evaluated on 13 performance criteria by balancing economic, ecological and societal decision objectives. Data input is, on the one side, a 1'732'051 x 13 performance tableau of size 2.6GB, and on the other side, a theoretical outranking space consisting of three trillions (3 x 1012) of pairwise outranking situations. A "small" set of 1000 decision alternatives, in a similar setting, may thus be ranked typically in about 2 seconds. [less ▲]

Detailed reference viewed: 23 (5 UL)
Full Text
Peer Reviewed
See detailRanking big performance tableaux with multiple incommensurable criteria and missing data
Bisdorff, Raymond UL

Scientific Conference (2016, January)

Detailed reference viewed: 39 (11 UL)
Full Text
Peer Reviewed
See detailComparisons of Heat Map and IFL Technique to Evaluate the Performance of Commercially Available Cloud Providers
Wagle, Shyam Sharan UL; Guzek, Mateusz UL; Bouvry, Pascal UL et al

in IEEE (Ed.) 2016 IEEE 9th International Conference on Cloud Computing (2016)

Cloud service providers (CSPs) offer different Ser- vice Level Agreements (SLAs) to the cloud users. Cloud Service Brokers (CSBs) provide multiple sets of alternatives to the cloud users according to ... [more ▼]

Cloud service providers (CSPs) offer different Ser- vice Level Agreements (SLAs) to the cloud users. Cloud Service Brokers (CSBs) provide multiple sets of alternatives to the cloud users according to users requirements. Generally, a CSB considers the service commitments of CSPs rather than the actual quality of CSPs services. To overcome this issue, the broker should verify the service performances while recommending cloud services to the cloud users, using all available data. In this paper, we compare our two approaches to do so: a min-max-min decomposition based on Intuitionistic Fuzzy Logic (IFL) and a Performance Heat Map technique, to evaluate the performance of commercially available cloud providers. While the IFL technique provides simple, total order of the evaluated CSPs, Performance Heat Map provides transparent and explanatory, yet consistent evaluation of service performance of commercially available CSPs. The identified drawbacks of the IFL technique are: 1) It does not return the accurate performance evaluation over multiple decision alternatives due to highly influenced by critical feedback of the evaluators; 2) Overall ranking of the CSPs is not as expected according to the performance measurement. As a result, we recommend to use performance Heat Map for this problem. [less ▲]

Detailed reference viewed: 93 (16 UL)
Full Text
Peer Reviewed
See detailAn Evaluation Model for Selecting Cloud Services from Commercially Available Cloud Providers
Wagle, Shyam Sharan UL; Guzek, Mateusz UL; Bouvry, Pascal UL et al

in 2015 IEEE 7th International Conference on Cloud Computing Technology and Science (CloudCom) (2015, December)

Detailed reference viewed: 92 (11 UL)
Full Text
Peer Reviewed
See detailOn boosting Kohler's ranking-by-choosing rule with a quantiles preordering
Bisdorff, Raymond UL

Scientific Conference (2015, February 06)

Detailed reference viewed: 18 (0 UL)
Full Text
See detailEvaluation and decision models with multiple criteria: Case studies
Bisdorff, Raymond UL; Dias, L. C.; Meyer, P. et al

Book published by Springer (2015)

Detailed reference viewed: 46 (7 UL)
See detailIntroduction
Bisdorff, Raymond UL; Dias, L. C.; Meyer, P. et al

Book published by Springer (2015)

Detailed reference viewed: 14 (0 UL)
Full Text
See detailThe EURO 2004 best poster award: Choosing the best poster in a scientific conference
Bisdorff, Raymond UL

Book published by Springer (2015)

Detailed reference viewed: 18 (0 UL)
Full Text
Peer Reviewed
See detailOn confident outrankings with multiple criteria of uncertain significance
Bisdorff, Raymond UL

Scientific Conference (2014, November 11)

Detailed reference viewed: 17 (0 UL)
Full Text
Peer Reviewed
See detailOn ranking-by-choosing with bipolar outranking digraphs of large orders
Bisdorff, Raymond UL

Scientific Conference (2014, October 27)

Detailed reference viewed: 9 (0 UL)
Full Text
Peer Reviewed
See detailOn weakly ordering by choosing from valued pairwise outranking situations
Bisdorff, Raymond UL

Scientific Conference (2014, January 31)

Detailed reference viewed: 9 (0 UL)
Full Text
See detailDocumentation of the Digraph3 Python software resources
Bisdorff, Raymond UL

Software (2014)

Detailed reference viewed: 35 (6 UL)
Full Text
Peer Reviewed
See detailElicitation of criteria weights maximising the stability of pairwise outranking statements
Bisdorff, Raymond UL; Meyer, P.; Veneziano, T.

in Journal of Multi-Criteria Decision Analysis (2014), 21(1-2), 113-124

Detailed reference viewed: 10 (0 UL)
Full Text
See detailThe Electre like outranking approach to MCDA
Bisdorff, Raymond UL

Presentation (2013, August)

Detailed reference viewed: 18 (0 UL)