default search action
Mária Lucká
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [c15]Jozef Sitarcík, Mária Lucká, Tibor Krajcovic:
Flower Pollination Algorithm for Detection of Epistasis Associated with a Phenotype. BIOINFORMATICS 2021: 118-126
2010 – 2019
- 2019
- [j7]Peter Laurinec
, Mária Lucká:
Interpretable multiple data streams clustering with clipped streams representation for the improvement of electricity consumption forecasting. Data Min. Knowl. Discov. 33(2): 413-445 (2019) - [j6]Peter Laurinec
Density-based unsupervised ensemble learning methods for time series forecasting of aggregated or clustered electricity consumption. J. Intell. Inf. Syst. 53(2): 219-239 (2019) - [c14]Jozef Sitarcík, Mária Lucká:
Cache-Efficient FM-Index Variants for Mapping of DNA Sequences. PACBB 2019: 45-52 - [c13]Martin Nemcek, Tomás Jarábek, Mária Lucká:
Parallel Density-Based Downsampling of Cytometry Data. PACBB 2019: 87-95 - 2018
- [j5]Peter Laurinec
Clustering-based forecasting method for individual consumers electricity load using time series representations. Open Comput. Sci. 8(1): 38-50 (2018) - [c12]Peter Laurinec
Application of Parallel Genetic Algorithm for Model-Based Gaussian Cluster Analysis. IBICA 2018: 140-150 - 2017
- [c11]Peter Laurinec
Usefulness of Unsupervised Ensemble Learning Methods for Time Series Forecasting of Aggregated or Clustered Load. NFMCP@PKDD/ECML 2017: 122-137 - 2016
- [j4]Anna Bou Ezzeddine, Marek Lóderer, Peter Laurinec
Using biologically inspired computing to effectively improve prediction models. Int. J. Hybrid Intell. Syst. 13(2): 99-112 (2016) - [c10]Peter Laurinec
Adaptive Time Series Forecasting of Energy Consumption Using Optimized Cluster Analysis. ICDM Workshops 2016: 398-405 - [c9]Tomás Farkas, Peter Kubán, Mária Lucká:
Effective Parallel Multicore-Optimized K-mers Counting Algorithm. SOFSEM 2016: 469-477 - 2015
- [c8]Gabriela Grmanová
Application of Biologically Inspired Methods to Improve Adaptive Ensemble Learning. NaBIC 2015: 235-246
2000 – 2009
- 2008
- [j3]Mária Lucká, Igor Melichercík, Ladislav Halada:
Application of multistage stochastic programs solved in parallel in portfolio management. Parallel Comput. 34(6-8): 469-485 (2008) - [c7]Siegfried Benkner, Christian Schröder, Mária Lucká, Othmar Steinhauser:
Grid Services for Parallel Molecular Dynamics with NAMD and CHARMM. ICCSA (1) 2008: 1036-1051 - 2007
- [c6]Rainer Schmidt, Siegfried Benkner
A Component Framework for Application Web Services. CoreGRID 2007: 107-116 - 2006
- [j2]Karl F. Doerner, Richard F. Hartl
Parallel Cooperative Savings Based Ant Colony Optimization - Multiple Search and Decomposition Approaches. Parallel Process. Lett. 16(3): 351-370 (2006) - 2004
- [c5]Karl Doerner, Richard F. Hartl
Parallel Ant Systems for the Capacitated Vehicle Routing Problem. EvoCOP 2004: 72-83 - 2003
- [c4]Ladislav Halada, Mária Lucká, Igor Melichercík:
Multiperiod Portfolio Management Using Parallel Interior Point Method. PARCO 2003: 853-860 - 2002
- [j1]Ladislav Halada, Siegfried Benkner, Mária Lucká:
Parallel Birge and Qi Factorization of Three-stage Stochastic Linear Programs. Parallel Distributed Comput. Pract. 5(3) (2002)
1990 – 1999
- 1999
- [c3]Ladislav Halada, Mária Lucká:
A Parallel Strongly Implicit Algorithm for Solving of Diffusion Equations. ACPC 1999: 78-84 - 1996
- [c2]Ladislav Halada, Mária Lucká:
A Partition Method for Solving Block Pentadiagonal Linear System on Intel Hypercube iPSC/860. ACPC 1996: 231-232 - 1993
- [c1]Mária Lucká:
An Effective Algorithm for Computation of Two-Dimensional Fourier Transform for NxM Matrices. ACPC 1993: 64-71
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-02 20:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: