default search action
Milos Seda
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j5]Milos Seda:
The Maximum Clique Problem and Integer Programming Models, Their Modifications, Complexity and Implementation. Symmetry 15(11): 1979 (2023) - 2022
- [j4]Dick Carrillo Melgarejo, Jirí Pokorný, Pavel Seda, Arun Narayanan, Pedro H. J. Nardelli, Mehdi Rasti, Jiri Hosek, Milos Seda, Demóstenes Z. Rodríguez, Yevgeni Koucheryavy, Gustavo Fraidenraich:
Optimizing Flying Base Station Connectivity by RAN Slicing and Reinforcement Learning. IEEE Access 10: 53746-53760 (2022) - [j3]Milos Seda:
The Assignment Problem and Its Relation to Logistics Problems. Algorithms 15(10): 377 (2022) - 2021
- [j2]Jirí Pokorný, Pavel Seda, Milos Seda, Jiri Hosek:
Modeling Optimal Location Distribution for Deployment of Flying Base Stations as On-Demand Connectivity Enablers in Real-World Scenarios. Sensors 21(16): 5580 (2021) - 2020
- [c12]Milos Seda, Pavel Seda:
Computational Geometry Data Structures in Logistics and Navigation Tasks. ICUMT 2020: 179-184
2010 – 2019
- 2019
- [j1]Pavel Seda, Michael Mark, Kuan-Wu Su, Milos Seda, Jiri Hosek, Jenq-Shiou Leu:
The Minimization of Public Facilities With Enhanced Genetic Algorithms Using War Elimination. IEEE Access 7: 9395-9405 (2019) - [c11]Milos Seda, Pavel Seda, Jindriska Sedova:
Job Shop Scheduling and Its Fuzzification Based on Operations and Disjunctive Graph Representations. ICUMT 2019: 1-5 - 2018
- [c10]Milos Seda, Pavel Seda:
Minimisation Of Network Covering Services With Predefined Centres. ECMS 2018: 282-287 - [c9]Pavel Seda, Pavel Masek, Jindriska Sedova, Milos Seda, Jan Krejci, Jiri Hosek:
Efficient Architecture Design for Software as a Service in Cloud Environments. ICUMT 2018: 1-6 - [c8]Milos Seda, Pavel Seda:
Minimisation of Networks Based on Computational Geometry Data Structures. ICUMT 2018: 1-5 - 2017
- [c7]Pavel Seda, Dominik Kovac, Jiri Hosek, Milos Seda:
Mobile platform for online QoE assessment in video streaming services. ICUMT 2017: 398-403 - [c6]Milos Seda, Pavel Seda:
Stochastic Heuristics for Knapsack Problems. MENDEL 2017: 157-166 - 2015
- [c5]Milos Seda, Pavel Seda:
A Minimisation of Network Covering Services in a Threshold Distance. MENDEL 2015: 159-169 - 2013
- [p2]Milos Seda:
Graph and Geometric Algorithms and Efficient Data Structures. Handbook of Optimization 2013: 73-95 - [p1]Pavel Osmera, Milos Seda, Roman Weisser:
Evolutionary Optimization of Controllers. Handbook of Optimization 2013: 869-887 - 2011
- [c4]Pavel Osmera, Jindrich Petrucha, Milos Seda, Radomil Matousek, Roman Weisser:
Two-Level Transplant Evolution for optimization of controllers. FSKD 2011: 2110-2115 - 2010
- [c3]Milos Seda:
Network Flows In Optimisation Problems And Their Extensions. ECMS 2010: 271-276 - [c2]Roman Weisser, Pavel Osmera, Milos Seda, Oldrich Kratochvil:
Transplant Evolution For Optimization Of General Controllers. ECMS 2010: 296-301
2000 – 2009
- 2003
- [c1]Milos Seda, Jirí Dvorák:
A framework for multicriteria selection based on measuring query responses. EUSFLAT Conf. 2003: 445-450
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-04-24 22:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint