Results 211 to 220 of about 4,614 (253)
A multiscale topology optimization design framework with data driven surrogate model. [PDF]
Sci RepZhou H, Zhou C.
europepmc +1 more source
On the Parameterized Complexity of Eulerian Strong Component Arc Deletion. [PDF]
AlgorithmicaBlažej V +3 more
europepmc +1 more source
Survey on mathematical modeling of infectious disease dynamics: insights and applications. [PDF]
BMC Infect DisEshtewy NA, Forootani A, Sisi ZA.
europepmc +1 more source
Non‐model plants: Challenges and solutions
Applications in Plant Sciences, EarlyView.
José M. Cunill‐Flores +2 more
wiley +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Scheduling and fixed-parameter tractability
Mathematical Programming, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Andreas Wiese +2 more
exaly +4 more sources
Fixed-parameter tractability for the Tree Assembly problem
Theoretical Computer Science, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Feng Shi 0003 +4 more
openaire +1 more source
2009
Parameterized complexity is a new theoretical framework that considers, in addition to the overall input size, the effects on computational complexity of a secondary measurement, the parameter. This two-dimensional viewpoint allows a fine-grained complexity analysis that takes structural properties of problem instances into account.
Samer Marko, Szeider Stefan
openaire +1 more source
Parameterized complexity is a new theoretical framework that considers, in addition to the overall input size, the effects on computational complexity of a secondary measurement, the parameter. This two-dimensional viewpoint allows a fine-grained complexity analysis that takes structural properties of problem instances into account.
Samer Marko, Szeider Stefan
openaire +1 more source
Fixed-Parameter Tractability of Dependency QBF with Structural Parameters
Proceedings of the Seventeenth International Conference on Principles of Knowledge Representation and Reasoning, 2020We study dependency quantified Boolean formulas (DQBF), an extension of QBF in which dependencies of existential variables are listed explicitly rather than being implicit in the order of quantifiers. DQBF evaluation is a canonical NEXPTIME-complete problem, a complexity class containing many prominent problems that arise in Knowledge Representation ...
Robert Ganian +3 more
openaire +1 more source