Search results

From MaRDI portal
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • and self-imposed psychological fear 2019-03-20 Paper Effect of active case finding on dengue control: implications from a mathematical model 2019-02-06...
    10 bytes (16 words) - 08:53, 7 October 2023
  • https://portal.mardi4nfdi.de/entity/Q4627767 2019-03-11 Paper Effect of active case finding on dengue control: implications from a mathematical model 2019-02-06...
    10 bytes (18 words) - 04:24, 12 December 2023
  • screening programmes: stable and nonstable disease models for multimodality case finding 2000-06-13 Paper Urn sampling and the proportional hazard model 1999-05-30...
    10 bytes (17 words) - 20:27, 24 September 2023
  • of some efficient root-finding simultaneous methods 2022-06-13 Paper Computational geometry as a tool for studying root-finding methods 2022-05-31 Paper...
    10 bytes (17 words) - 20:11, 12 December 2023
  • de/entity/Q3599224 2009-02-03 Paper Finding strong defining hyperplanes of PPS using multiplier form 2008-12-05 Paper FINDING THE REFERENCE SET OF A DECISION...
    10 bytes (18 words) - 12:23, 11 December 2023
  • analysis: a case study in IROST 2005-06-13 Paper Sensitivity and stability analysis in data envelopment analysis 2005-06-07 Paper Finding the piecewise...
    10 bytes (18 words) - 12:23, 11 December 2023
  • inverse conductivity problems based on vector, variational principles: the 2D case 2024-04-16 Paper Coupling homogeneous chains of damped harmonic oscillators...
    10 bytes (17 words) - 11:36, 12 December 2023
  • dispersive media in civil engineering 2010-08-06 Paper Polynomial root finding technique for joint DOA DOD estimation in bistatic MIMO radar 2010-08-06...
    10 bytes (16 words) - 02:11, 9 December 2023
  • Paper Average Case Approximation: Convergence and Tractability of Gaussian Kernels 2013-07-31 Paper Discontinuous information in the worst case and randomized...
    10 bytes (17 words) - 15:00, 7 December 2023
  • project-join constructibility in relational databases 1987-01-01 Paper On finding a worst-case optimal fourth normal form database decomposition 1987-01-01 Paper...
    10 bytes (16 words) - 22:04, 12 December 2023
  • Trials 2020-09-24 Paper A case for robust Bayesian priors with applications to clinical trials 2016-02-12 Paper Dose-Finding Based on Efficacy-Toxicity...
    10 bytes (18 words) - 19:52, 9 December 2023
  • Paper Finding a feasible flow in a strongly connected network 2009-03-04 Paper Reachability Problems on Directed Graphs 2009-01-29 Paper Finding Dominators...
    10 bytes (19 words) - 21:52, 9 December 2023
  • 2017-01-05 Paper Finding compromise solutions in project portfolio selection with multiple experts by inverse optimization 2016-11-17 Paper On finding representative...
    10 bytes (19 words) - 12:57, 8 December 2023
  • 2002-09-30 Paper Finding a cluster of zeros of univariate polynomials 2001-07-05 Paper Accelerated shift-and-add algorithms 2000-09-04 Paper Finding zeros of analytic...
    10 bytes (18 words) - 00:59, 12 December 2023
  • Alternative to Ritt's pseudodivision for finding the input-output equations of multi-output models 2012-09-18 Paper Finding identifiable parameter combinations...
    10 bytes (20 words) - 20:17, 8 December 2023
  • Publication Date of Publication Type Worst-case evaluation complexity of a derivative-free quadratic regularization method 2024-01-22 Paper Adaptive Third-Order...
    10 bytes (18 words) - 12:52, 28 January 2024
  • 2023-11-02 Paper A Lower Bound on Cycle-Finding in Sparse Digraphs 2023-10-31 Paper A Lower Bound on Cycle-Finding in Sparse Digraphs 2021-02-02 Paper Longitudinal...
    10 bytes (17 words) - 05:05, 9 December 2023
  • method for solving integer max-linear optimization problems in a generic case 2015-06-18 Paper On the integer max-linear programming problem 2014-09-12...
    10 bytes (17 words) - 09:59, 9 December 2023
  • algorithm for finding the most vital edge in weighted graphs 1998-10-01 Paper Optimal parallel algorithms for coloring bounded degree graphs and finding maximal...
    10 bytes (17 words) - 12:40, 28 January 2024
  • de/entity/Q3579421 2010-08-06 Paper Finding a maximum matching in a sparse random graph in O ( n ) expected time 2010-07-14 Paper Average-Case Analyses of Vickrey Costs...
    10 bytes (16 words) - 21:05, 11 December 2023
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)