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
An improved heuristic for lower reliability bound evaluatio..:
, In:
12th International Conference on Quality, Reliability, Risk, Maintenance, and Safety Engineering (QR2MSE 2022)
,
Wang, S.
;
Liu, T.
;
Bai, G.
... - p. None , 2022
Link:
https://doi.org/10.1049/icp.2022.2958
RT T1
12th International Conference on Quality, Reliability, Risk, Maintenance, and Safety Engineering (QR2MSE 2022)
: T1
An improved heuristic for lower reliability bound evaluation of multistate networks
UL https://suche.suub.uni-bremen.de/peid=ieee-10110588&Exemplar=1&LAN=DE A1 Wang, S. A1 Liu, T. A1 Bai, G. A1 Fang, Y. A1 Zhang, Y. A1 Tao, J. YR 2022 K1 computational complexity K1 heuristic programming K1 network theory (graphs) K1 optimisation K1 probability K1 reliability theory K1 computational experiments K1 computational resources K1 decision makers K1 lower reliability bound evaluation K1 LRB convergence K1 minimal path vectors K1 multistate flow networks K1 NP-hard problem K1 real networks K1 recursive sum of disjoint product method K1 union probability calculation SP None LK http://dx.doi.org/https://doi.org/10.1049/icp.2022.2958 DO https://doi.org/10.1049/icp.2022.2958 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)