Results 241 to 250 of about 2,616,817 (282)

Physics-Constrained Reconstructions of Sunspot Number from Millennial-Scale Annual Heliospheric Modulation Potential. [PDF]

Sol Phys
Saha C, Owens M, Lockwood M, Barnard L, Brehm N, Dalla S, Herbst K, Muscheler R, Wang J.   +8 more
europepmc   +1 more source

Evaluating the Resilience of ICU Nurse Staffing Standard Operating Procedures Under Demand Variability: A Discrete Event Simulation Study Using MIMIC-IV. [PDF]

Healthcare (Basel)
Bashatah J, Bashatah A.
europepmc   +1 more source

Inferring Branch-Specific Rates of Lineage Diversification Under the Birth-Death-Shift Process. [PDF]

Syst Biol
Höhna S, Freyman WA, Nolen Z, Huelsenbeck JP, May MR, Rannala B, Moore BR.   +6 more
europepmc   +1 more source

Evaluating syphilis transmission among MSM population: a mathematical model for reinfection, two-stage treatment, and treatment failure. [PDF]

Front Public Health
Chukwu CW, Aldila D, Lawal MA, Obaido G.
europepmc   +1 more source

Computer Vision Enables Monitoring and Kinetic Analysis of Structurally Diverse Carbon Monoxide Surrogates. [PDF]

Angew Chem Int Ed Engl
Donnachie K, Griffin C, Gray ML, McCabe TJD, Reid M.   +4 more
europepmc   +1 more source

Scheduling and fixed-parameter tractability

Mathematical Programming, 2014
Fixed-parameter tractability analysis and scheduling are two core domains of combinatorial optimization which led to deep understanding of many important algorithmic questions.
Andreas Wiese, Matthias Mnich
exaly   +9 more sources

Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs [PDF]

SIAM Journal on Discrete Mathematics, 2015
The Multicut problem, given a graph G, a set of terminal pairs $\mathcal{T}=\{(s_i,t_i)\ |\ 1\leq i\leq r\}$, and an integer $p$, asks whether one can find a cutset consisting of at most $p$ nonterminal vertices that separates all the terminal pairs, i.e.
Marcin Pilipczuk, Michal Pilipczuk, Stefan Kratsch   +2 more
exaly   +10 more sources

On the fixed-parameter tractability of parameterized model-checking problems [PDF]

Information Processing Letters, 2008
In this note, we show, through the use of examples, how generic results for proving fixed-parameter tractability which apply to restricted classes of structures can sometimes be more widely ...
Iain Stewart
exaly   +2 more sources

On Fixed-Parameter Tractability and Approximability of NP Optimization Problems [PDF]

Journal of Computer and System Sciences, 1997
Fixed-parameter tractability of NP optimization problems is studied by relating it to approximability of the problems. It is shown that an NP optimization problem is fixed-parameter tractable if it admits a fully polynomial-time approximation scheme, or ...
Jianer Chen
exaly   +2 more sources