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
A parallel heuristic for a k-medoids clustering problem wit..:
, In:
2019 42nd International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO)
,
Ushakov, Anton V.
;
Vasilyev, Igor
- p. 1116-1120 , 2019
Link:
https://doi.org/10.23919/MIPRO.2019.8756919
RT T1 <cTitle>2019 42nd International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO)</cTitle>: T1 <Title>A parallel heuristic for a k-medoids clustering problem with unfixed number of clusters</Title> UL https://suche.suub.uni-bremen.de/peid=ieee-8756919&Exemplar=1&LAN=DE A1 Ushakov, Anton V. A1 Vasilyev, Igor YR 2019 SN 2623-8764 K1 Clustering algorithms K1 Approximation algorithms K1 Heuristic algorithms K1 Linear programming K1 Simulated annealing K1 Measurement K1 k-medoids clustering K1 parallel computing K1 k-median problem K1 Lagrangian relaxation K1 simulated annealing K1 exemplar-based clustering SP 1116 OP 1120 LK http://dx.doi.org/https://doi.org/10.23919/MIPRO.2019.8756919 DO https://doi.org/10.23919/MIPRO.2019.8756919 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
