Zobrazeno 1 - 10
of 56
pro vyhledávání: '"Jácint Szabó"'
Autor:
Jácint Szabó, András Recski
Publikováno v:
Discrete Applied Mathematics. 276:129-133
The matroid parity problem is known to be unsolvable in polynomial time in the general case and is polynomial for linearly represented matroids. Its generalization asks if there exists an independent set in a matroid, intersecting k-tuples in a given
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::178231c7d3de0ff0c3e674481353288b
https://doi.org/10.1016/j.dam.2019.09.023
https://doi.org/10.1016/j.dam.2019.09.023
Autor:
Thomas Walter, Randall L. Cogill, Jácint Szabó, Marco Laumanns, Thanh Lam Hoang, Rahul Nair, Bei Chen
Publikováno v:
Transportation Research Part C: Emerging Technologies. 104:196-209
A large-scale ensemble prediction model to predict train delays is presented. The ensemble model uses a disparate set of models, two statistical and one simulation-based to generate forecasts of train delays. The first statistical model is a context-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::965b6a9831d1cf9120af9b3bc5d0da09
https://doi.org/10.1016/j.trc.2019.04.026
https://doi.org/10.1016/j.trc.2019.04.026
Publikováno v:
Journal of Rail Transport Planning & Management. 8:167-183
With continuously increasing capacity utilization of railway networks as well as growing requirements on service quality and reliability, railway timetabling is becoming increasingly difficult. Although most timetables are still constructed manually
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7c403a417141810401a0e5c5cd863c5f
https://doi.org/10.1016/j.jrtpm.2018.09.003
https://doi.org/10.1016/j.jrtpm.2018.09.003
Publikováno v:
Discrete Applied Mathematics. 251:93-102
We present a routing system that considers uncertainties, which are prevalent in any real transport system. Given desired departure or arrival times and a utility function representing the traveller’s preferences, our method computes not just a sin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::84b0c25623f6dade0e416ce0746f9836
https://doi.org/10.1016/j.dam.2018.05.031
https://doi.org/10.1016/j.dam.2018.05.031
Publikováno v:
Transportation Research Procedia. 27:1080-1087
Embodiments relate to generating a route plan. A method of generating a route plan is provided. The method receives a route planning request that includes a starting location, a destination location, a desired arrival time, and a set of user preferen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8caef6bce50fca78df0d91fc0c44b104
https://doi.org/10.1016/j.trpro.2017.12.096
https://doi.org/10.1016/j.trpro.2017.12.096
Publikováno v:
Middleware Industry
Uncorrectable errors in dynamic random access memory (DRAM) are a common form of hardware failure in server clusters. Failures are costly both in terms of hardware replacement costs and service disruption. While a large body of work exists on analyzi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0252904f7ca5296fc6157fdf06d55648
https://doi.org/10.1145/3154448.3154451
https://doi.org/10.1145/3154448.3154451
Publikováno v:
IEEE Transactions on Smart Grid, 10 (2)
A variety of energy resources has been identified as being flexible in their electric energy consumption or generation. This energetic flexibility can be used for various purposes such as minimizing energy procurement costs or providing ancillary ser
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b980731e10187cd93ab65d6af4de5658
Autor:
Jácint Szabó, Zoltán Király
Publikováno v:
Graphs and Combinatorics. 26:243-257
Let $${\mathcal{H}}$$be a set of undirected graphs. The induced $${\mathcal{H}}$$-packing problem in an input graph G is to find a subgraph Q of G of maximum size such that each connected component of Q is an induced subgraph of G and is isomorphic t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::af289f941ff0273bf44e957db71f245f
https://doi.org/10.1007/s00373-010-0906-0
https://doi.org/10.1007/s00373-010-0906-0
Autor:
Marek Janata, Jácint Szabó
Publikováno v:
Combinatorica. 29:27-48
Hell and Kirkpatrick proved that in an undirected graph, a maximum size packing by a set of non-singleton stars can be found in polynomial time if this star-set is of the form {S 1, S 2, ..., S k } for some k∈ℤ+ (S i is the star with i leaves), a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c280a34deb6341b19f83f3796eeeb7c4
https://doi.org/10.1007/s00493-009-1986-4
https://doi.org/10.1007/s00493-009-1986-4
Autor:
Jácint Szabó, Márton Makai
Publikováno v:
Combinatorica. 28:679-692
According to the present state of the theory of the matroid parity problem, the existence of a good characterization to the size of a maximum matching depends on the behavior of certain substructures, called double circuits. In this paper we prove th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8d36fff619f2eba911b5677266f833fd
https://doi.org/10.1007/s00493-008-2374-1
https://doi.org/10.1007/s00493-008-2374-1