I agree that this site is using cookies. You can find further informations
here
.
X
Login
Merkliste (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
zur Desktop-Version
Toggle navigation
Merkliste
1 Ergebnisse
1
Introducing the Expohedron for Efficient Pareto-optimal Fai..:
, In:
Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining
,
Kletti, Till
;
Renders, Jean-Michel
;
Loiseau, Patrick
- p. 498-507 , 2022
Link:
https://dl.acm.org/doi/10.1145/3488560.3498490
RT T1 <cTitle>Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining</cTitle>: T1 <Title>Introducing the Expohedron for Efficient Pareto-optimal Fairness-Utility Amortizations in Repeated Rankings</Title> UL https://suche.suub.uni-bremen.de/peid=acm-3498490&Exemplar=1&LAN=DE A1 Kletti, Till A1 Renders, Jean-Michel A1 Loiseau, Patrick PB ACM YR 2022 K1 amortization K1 balanced words K1 expohedron K1 fairness K1 gls K1 muli-objective optimization K1 pareto-optimal K1 ranking K1 Information systems K1 Information retrieval K1 Retrieval models and ranking K1 Probabilistic retrieval models K1 World Wide Web K1 Web searching and information discovery K1 Content ranking K1 Mathematics of computing K1 Discrete mathematics K1 Combinatorics K1 Permutations and combinations SP 498 OP 507 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/3488560.3498490 DO https://dl.acm.org/doi/10.1145/3488560.3498490 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
