Zobrazeno 1 - 10
of 106
pro vyhledávání: '"Martin Gebser"'
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 65, Iss Proc. LoCoCo 2011, Pp 12-25 (2011)
We present the Linux package configuration tool aspcud based on Answer Set Programming. In particular, we detail aspcud's preprocessor turning a CUDF specification into a set of logical facts.
Externí odkaz:
https://doaj.org/article/3a916cb2f43a4f01b06027bf639d0160
Autor:
Pierre Tassel, Benjamin Kovács, Martin Gebser, Konstantin Schekotihin, Wolfgang Kohlenbrein, Philipp Schrott-Kostwein
Publikováno v:
Proceedings of the International Conference on Automated Planning and Scheduling. 32:638-646
Scheduling is an important problem for many applications, including manufacturing, transportation, or cloud computing. Unfortunately, most of the scheduling problems occurring in practice are intractable and, therefore, solving large industrial insta
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e9f3266006af87eef41ef2c54406dca2
https://doi.org/10.1609/icaps.v32i1.19852
https://doi.org/10.1609/icaps.v32i1.19852
Publikováno v:
Scopus-Elsevier
Efficient omission of symmetric solution candidates is essential for combinatorial problem-solving. Most of the existing approaches are instance-specific and focus on the automatic computation of Symmetry Breaking Constraints (SBCs) for each given pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fbf95299aefe18f81de6c869bbd39219
https://doi.org/10.1007/s10994-022-06146-3
https://doi.org/10.1007/s10994-022-06146-3
Publikováno v:
Digital Transformation ISBN: 9783662650035
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5bee72e2093270c31cc5c8c17e80b6d8
https://doi.org/10.1007/978-3-662-65004-2_16
https://doi.org/10.1007/978-3-662-65004-2_16
Publikováno v:
Practical Aspects of Declarative Languages ISBN: 9783031248405
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e81475672b0514ad6d8597cc65587331
https://doi.org/10.1007/978-3-031-24841-2_6
https://doi.org/10.1007/978-3-031-24841-2_6
Publikováno v:
2022 14th International Conference on Advanced Semiconductor Devices and Microsystems (ASDAM).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::be09335513457037618b6c9ff21e8b16
https://doi.org/10.1109/asdam55965.2022.9966756
https://doi.org/10.1109/asdam55965.2022.9966756
Publikováno v:
Electronic Proceedings in Theoretical Computer Science. 364
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c68f23ac2644f26a30121da067bb43f7
https://doi.org/10.4204/eptcs.364.0
https://doi.org/10.4204/eptcs.364.0
The Job-shop Scheduling Problem (JSP) is a well-known and challenging combinatorial optimization problem in which tasks sharing a machine are to be arranged in a sequence such that encompassing jobs can be completed as early as possible. In this pape
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e37ffaf777e5980334daa75583c92431
http://arxiv.org/abs/2205.07537
http://arxiv.org/abs/2205.07537
Many industrial applications require finding solutions to challenging combinatorial problems. Efficient elimination of symmetric solution candidates is one of the key enablers for high-performance solving. However, existing model-based approaches for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::384ca66616b5d61facf4a15990fe88d4
http://arxiv.org/abs/2205.07129
http://arxiv.org/abs/2205.07129
Publikováno v:
2022 33rd Annual SEMI Advanced Semiconductor Manufacturing Conference (ASMC).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::586232d80a993f5998be493eefbf4dab
https://doi.org/10.1109/asmc54647.2022.9792520
https://doi.org/10.1109/asmc54647.2022.9792520