Results 211 to 220 of about 4,614 (253)

Multiagent game-theoretic robust optimization for power system planning under source-load uncertainty. [PDF]

Sci Rep
Mi J, Xu M, An J, Wang Y, Liu F, Yang H, Tan Z.   +6 more
europepmc   +1 more source

A multiscale topology optimization design framework with data driven surrogate model. [PDF]

Sci Rep
Zhou H, Zhou C.
europepmc   +1 more source

On the Parameterized Complexity of Eulerian Strong Component Arc Deletion. [PDF]

Algorithmica
Blažej V, Jana S, Ramanujan MS, Strulo P.   +3 more
europepmc   +1 more source

Survey on mathematical modeling of infectious disease dynamics: insights and applications. [PDF]

BMC Infect Dis
Eshtewy NA, Forootani A, Sisi ZA.
europepmc   +1 more source

Non‐model plants: Challenges and solutions

Applications in Plant Sciences, EarlyView.
José M. Cunill‐Flores, Guanjing Hu, Aarón I. Vélez‐Ramírez   +2 more
wiley   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Scheduling and fixed-parameter tractability

Mathematical Programming, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Andreas Wiese, Matthias Mnich, Mnich Matthias   +2 more
exaly   +4 more sources

Fixed-parameter tractability for the Tree Assembly problem

Theoretical Computer Science, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Feng Shi 0003, Jie You, Zhen Zhang 0025, Jingyi Liu, Jianxin Wang 0001   +4 more
openaire   +1 more source

Fixed-Parameter Tractability

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