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
Harvesting Efficient On-Demand Order Pooling from Skilled C..:
, In:
Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining
,
Liang, Yile
;
Zhao, Jiuxia
;
Li, Donghui
... - p. 5363-5374 , 2024
Link:
https://dl.acm.org/doi/10.1145/3637528.3671643
RT T1
Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining
: T1
Harvesting Efficient On-Demand Order Pooling from Skilled Couriers: Enhancing Graph Representation Learning for Refining Real-time Many-to-One Assignments
UL https://suche.suub.uni-bremen.de/peid=acm-3671643&Exemplar=1&LAN=DE A1 Liang, Yile A1 Zhao, Jiuxia A1 Li, Donghui A1 Feng, Jie A1 Zhang, Chen A1 Ding, Xuetao A1 Hao, Jinghua A1 He, Renqing PB ACM YR 2024 K1 graph representation learning K1 many-to-one assignment problem K1 on-demand food delivery K1 order pooling K1 Computing methodologies K1 Artificial intelligence K1 Planning and scheduling K1 Planning for deterministic actions SP 5363 OP 5374 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/3637528.3671643 DO https://dl.acm.org/doi/10.1145/3637528.3671643 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)