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
Determining The Delivery Of Goods Using The K-Nearest Neigh..:
, In:
2023 International Conference on Computer Science, Information Technology and Engineering (ICCoSITE)
,
Lidiawati
;
Setiawan, Hendra
;
Ramdhani, Adhitya Ilham
... - p. 957-961 , 2023
Link:
https://doi.org/10.1109/ICCoSITE57641.2023.10127714
RT T1 <cTitle>2023 International Conference on Computer Science, Information Technology and Engineering (ICCoSITE)</cTitle>: T1 <Title>Determining The Delivery Of Goods Using The K-Nearest Neighbor Algorithm And The Saving Matrix Method To Obtain The Optimal Route And Save Costs</Title> UL https://suche.suub.uni-bremen.de/peid=ieee-10127714&Exemplar=1&LAN=DE A1 Lidiawati A1 Setiawan, Hendra A1 Ramdhani, Adhitya Ilham A1 Satria A1 Sulistyowati A1 Mukiman, Kikim YR 2023 K1 Computer science K1 Costs K1 Transportation K1 Companies K1 Product delivery K1 Delays K1 Classification algorithms K1 Route K1 K-Nearest Neighbor Algorithm K1 Saving Matrix Method K1 Cost Savings SP 957 OP 961 LK http://dx.doi.org/https://doi.org/10.1109/ICCoSITE57641.2023.10127714 DO https://doi.org/10.1109/ICCoSITE57641.2023.10127714 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
