Treffer 1 - 20
von 147.234
- 1
- 2
Seite in der Trefferliste auswählen
Portfolio Optimization with Stochastic Return Functions: An Algorithmic Approach
Saxena, Aditya
2025 12th International Conference on Emerging Trends in Engineering & Technology - Signal and Information Processing (ICETET - SIP) Emerging Trends in Engineering & Technology - Signal and Information Processing (ICETET - SIP), 2025 12th International Conference on. :1-6 Aug, 2025
Approximation Meets Quantum: A Parameterized Framework for Large-Scale Graph Coloring
Pitale, Rahul ; Tajane, Kapil ; Ahire, Prashant G. ; et al.
2025 5th Asian Conference on Innovation in Technology (ASIANCON) Innovation in Technology (ASIANCON), 2025 5th Asian Conference on. :1-9 Aug, 2025
Hybrid Metaheuristic Algorithms with Dynamic Clause Weight Adjustments for Efficient Optimization of NP-Hard Problems
Ishtaiwi, Abdelraouf ; HajYasien, Ahmed ; Quaddoura, Ruzayn ; et al.
2025 1st International Conference on Computational Intelligence Approaches and Applications (ICCIAA) Computational Intelligence Approaches and Applications (ICCIAA), 2025 1st International Conference on. :1-7 Apr, 2025
Dieses Ergebnis kann Gästen nicht angezeigt werden.
Login für vollen Zugriff.
Algorithmic results for weak Roman domination problem in graphs.
Paul, Kaustav ; Sharma, Ankit ; Pandey, Arti
Discrete Applied Mathematics. Dec2024, Vol. 359, p278-289. 12p.
From P ≟ NP to Practice: Description Complexity and Certificate-First Algorithm Discovery for Hard Problems.
Abela, John ; Cachia, Ernest ; Layfield, Colin
Mathematics (2227-7390). Jan2026, Vol. 14 Issue 1, p41. 33p.
Total Completion Time Scheduling Under Scenarios.
Bosman, Thomas ; van Ee, Martijn ; Ergen, Ekin ; et al.
Theory of Computing Systems. Dec2025, Vol. 69 Issue 4, p1-41. 41p.
Discerning Between the “Easy” and “Hard” Problems of AI Governance
Minkkinen, M. ; Mantymaki, M.
IEEE Transactions on Technology and Society IEEE Trans. Technol. Soc. Technology and Society, IEEE Transactions on. 4(2):188-194 Jun, 2023
Exact and approximation algorithms for covering timeline in temporal graphs.
Dondi, Riccardo ; Popa, Alexandru
Annals of Operations Research. Aug2025, Vol. 351 Issue 1, p609-628. 20p.
Algorithmics of NP-Hard Problems
Problems Reducing the Exhaustive Search
Freidzon, R. I.
AMERICAN MATHEMATICAL SOCIETY TRANSLATIONS. (178):1-4
The spanning tree congestion problem on interval graphs.
Lin, Lan ; Lin, Yixun
Discrete Applied Mathematics. Dec2025, Vol. 377, p147-153. 7p.
Asymptotic Analysis of Problem Formulations for Quantum Annealers
Auto, Julio ; Shi, Fred
2023 IEEE International Conference on Quantum Computing and Engineering (QCE) QCE Quantum Computing and Engineering (QCE), 2023 IEEE International Conference on. 01:385-396 Sep, 2023
Finding maximum common contractions between phylogenetic networks.
Marchand, Bertrand ; Tahiri, Nadia ; Fard, Shohreh Golpaigani ; et al.
Algorithms for Molecular Biology. 10/1/2025, Vol. 20 Issue 1, p1-30. 30p.
Student-project allocation with preferences over projects: Algorithmic and experimental results.
Manlove, David ; Milne, Duncan ; Olaosebikan, Sofiat
Discrete Applied Mathematics. Feb2022, Vol. 308, p220-234. 15p.
(Re)packing Equal Disks into Rectangle.
Fomin, Fedor V. ; Golovach, Petr A. ; Inamdar, Tanmay ; et al.
Discrete & Computational Geometry. Dec2024, Vol. 72 Issue 4, p1596-1629. 34p.
Algorithmic Analysis ofQualitative and Quantitative Termination Problems for Affine Probabilistic Programs.
CHATTERJEE, KRISHNENDU ; HONGFEI FU ; NOVOTNÝ, PETR ; et al.
ACM Transactions on Programming Languages & Systems. May2018, Vol. 40 Issue 2, p7-45. 45p.
Globally Linked Pairs and Cheapest Globally Rigid Supergraphs.
Jordán, Tibor ; Villányi, Soma
SIAM Journal on Discrete Mathematics. 2025, Vol. 39 Issue 3, p1520-1544. 25p.
Maximal universal width of an AFA is NP-hard.
Alajaji, John ; Salomaa, Kai
Theoretical Computer Science. Aug2025, Vol. 1045, pN.PAG-N.PAG. 1p.
Hard Problems on Layered Graphs: Parallel Algorithms and Improvements
Chitturi, Bhadrachalam ; Srinath, T
2018 IEEE 8th International Advance Computing Conference (IACC) Advance Computing Conference (IACC), 2018 IEEE 8th International. :207-212 Dec, 2018
Stabilization of capacitated matching games: Stabilization of capacitated matching games: M. Gerstbrein et al.
Gerstbrein, Matthew ; Sanità, Laura ; Verberk, Lucy
Mathematical Programming. Mar2025, Vol. 210 Issue 1, p313-334. 22p.
- 1
- 2