DIKUL - logo

Rezultati iskanja

Osnovno iskanje    Ukazno iskanje   

Trenutno NISTE avtorizirani za dostop do e-virov UL. Za polni dostop se PRIJAVITE.

1 2
zadetkov: 11
1.
  • Improving Clairvoyant: redu... Improving Clairvoyant: reduction algorithm resilient to imbalanced process arrival patterns
    Proficz, Jerzy; Ocetkiewicz, Krzysztof M. The Journal of supercomputing, 06/2021, Letnik: 77, Številka: 6
    Journal Article
    Recenzirano
    Odprti dostop

    The Clairvoyant algorithm proposed in “A novel MPI reduction algorithm resilient to imbalances in process arrival times” was analyzed, commented and improved. The comments concern handling certain ...
Celotno besedilo
Dostopno za: UL

PDF
2.
  • UNRES-GPU for physics-based... UNRES-GPU for physics-based coarse-grained simulations of protein systems at biological time- and size-scales
    Ocetkiewicz, Krzysztof M; Czaplewski, Cezary; Krawczyk, Henryk ... Bioinformatics, 06/2023, Letnik: 39, Številka: 6
    Journal Article
    Recenzirano
    Odprti dostop

    Abstract Summary The UNited RESisdue (UNRES) package for coarse-grained simulations, which has recently been optimized to treat large protein systems, has been implemented on Graphical Processor ...
Celotno besedilo
Dostopno za: UL
3.
  • Long‐time scale simulations... Long‐time scale simulations of virus‐like particles from three human‐norovirus strains
    Lipska, Agnieszka G.; Sieradzan, Adam K.; Czaplewski, Cezary ... Journal of computational chemistry, June 15, 2023, Letnik: 44, Številka: 16
    Journal Article
    Recenzirano
    Odprti dostop

    The dynamics of the virus like particles (VLPs) corresponding to the GII.4 Houston, GII.2 SMV, and GI.1 Norwalk strains of human noroviruses (HuNoV) that cause gastroenteritis was investigated by ...
Celotno besedilo
Dostopno za: UL
4.
  • Optimization of parallel im... Optimization of parallel implementation of UNRES package for coarse‐grained simulations to treat large proteins
    Sieradzan, Adam K.; Sans‐Duñó, Jordi; Lubecka, Emilia A. ... Journal of computational chemistry, February 5, 2023, Letnik: 44, Številka: 4
    Journal Article
    Recenzirano

    We report major algorithmic improvements of the UNRES package for physics‐based coarse‐grained simulations of proteins. These include (i) introduction of interaction lists to optimize computations, ...
Celotno besedilo
Dostopno za: UL
5.
  • A FPTAS for minimizing tota... A FPTAS for minimizing total completion time in a single machine time-dependent scheduling problem
    Ocetkiewicz, Krzysztof M. European journal of operational research, 06/2010, Letnik: 203, Številka: 2
    Journal Article
    Recenzirano

    In this paper a single machine time-dependent scheduling problem with total completion time criterion is considered. There are given n jobs J 1 , … , J n and the processing time p i of the ith job is ...
Celotno besedilo
Dostopno za: UL
6.
  • Partial dominated schedules... Partial dominated schedules and minimizing the total completion time of deteriorating jobs
    Ocetkiewicz, Krzysztof M. Optimization, 10/1/2013, 2013-10-00, 20131001, Letnik: 62, Številka: 10
    Journal Article
    Recenzirano

    A problem of scheduling deteriorating jobs on a single processor is considered. The processing time of a job is given by a function , where is the starting time of the job, , , for Jobs are ...
Celotno besedilo
Dostopno za: UL
7.
Celotno besedilo
8.
  • Multi-GPU UNRES for scalabl... Multi-GPU UNRES for scalable coarse-grained simulations of very large protein systems
    Ocetkiewicz, Krzysztof M.; Czaplewski, Cezary; Krawczyk, Henryk ... Computer physics communications, 20/May , Letnik: 298
    Journal Article
    Recenzirano
    Odprti dostop

    Graphical Processor Units (GPUs) are nowadays widely used in all-atom molecular simulations because of the advantage of efficient partitioning of atom pairs between the kernels to compute the ...
Celotno besedilo
Dostopno za: UL
9.
  • A FPTAS for minimizing tota... A FPTAS for minimizing total completion time in a single machine time-dependent scheduling problem
    Ocetkiewicz, Krzysztof M European journal of operational research, 06/2010, Letnik: 203, Številka: 2
    Journal Article
    Recenzirano

    In this paper a single machine time-dependent scheduling problem with total completion time criterion is considered. There are given n jobs J1,...,Jn and the processing time p(i) of the ith job is ...
Celotno besedilo
Dostopno za: UL
10.
  • KOALA GRAPH THEORY INTERNET... KOALA GRAPH THEORY INTERNET SERVICE
    TOMASZ GOLUCH; KRZYSZTOF M. OCETKIEWICZ; KRZYSZTOF GIARO T.A.S.K. quarterly, 10/2015, Letnik: 19, Številka: 4
    Journal Article
    Odprti dostop

    KOALA has been created with the idea of C++ library templates, implementing a broad set of procedures in the fields of algorithmic graph theory and network problems in discrete optimization. During ...
Celotno besedilo
Dostopno za: UL
1 2
zadetkov: 11

Nalaganje filtrov