335 results on '"Bisdorff, Raymond"'
Search Results
2. Bipolar-Valued Undirected Graphs
3. Robustness Analysis of Outranking Digraphs
4. On Tree Graphs and Graph Forests
5. Rating by Sorting into Relative Performance Quantiles
6. About Split, Comparability, Interval, and Permutation Graphs
7. On Computing Digraph Kernels
8. Tempering Plurality Tyranny Effects in Social Choice
9. On Measuring the Fitness of a Multiple-Criteria Ranking
10. Exercises
11. Alice’s Best Choice: A Selection Case Study
12. The Best Academic Computer Science Depts: A Ranking Case Study
13. The Best Students, Where Do They Study? A Rating Case Study
14. Ranking with Multiple Incommensurable Criteria
15. How to Create a New Multiple-Criteria Performance Tableau
16. Building a Best Choice Recommendation
17. Who Wins the Election?
18. Working with Outranking Digraphs
19. Working with Bipolar-Valued Digraphs
20. Generating Random Performance Tableaux
21. Rating-by-Ranking with Learned Performance Quantile Norms
22. Working with the Digraph3 Python Resources
23. HPC Ranking of Big Performance Tableaux
24. Algorithmic Decision Making with Python Resources
25. Who Wins the Election?
26. Rating-by-Ranking with Learned Performance Quantile Norms
27. Rating by Sorting into Relative Performance Quantiles
28. HPC Ranking of Big Performance Tableaux
29. On Confident Outrankings with Uncertain Criteria Significance Weights
30. Tempering Plurality Tyranny Effects in Social Choice
31. On Tree Graphs and Graph Forests
32. How to Create a New Multiple-Criteria Performance Tableau
33. On Measuring the Fitness of a Multiple-Criteria Ranking
34. Bipolar-Valued Undirected Graphs
35. Generating Random Performance Tableaux
36. The Best Academic Computer Science Depts: A Ranking Case Study
37. The Best Students, Where Do They Study? A Rating Case Study
38. Exercises
39. About Split, Comparability, Interval, and Permutation Graphs
40. Alice’s Best Choice: A Selection Case Study
41. Robustness Analysis of Outranking Digraphs
42. Working with the Digraph3 Python Resources
43. Working with Bipolar-Valued Digraphs
44. Building a Best Choice Recommendation
45. Working with Outranking Digraphs
46. Ranking with Multiple Incommensurable Criteria
47. On Computing Digraph Kernels
48. Counting non-isomorphic maximal independent sets of the n-cycle graph
49. The EURO 2004 Best Poster Award: Choosing the Best Poster in a Scientific Conference
50. Introduction
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.