Results 41 to 50 of about 21,948 (228)
Impact of Near-Positivity Violations on IPTW-Estimated Marginal Structural Survival Models With Time-Dependent Confounding. [PDF]
Biom JABSTRACT In longitudinal observational studies, marginal structural models (MSMs) are used to analyze the causal effect of an exposure on the (time‐to‐event) outcome of interest, while accounting for exposure‐affected time‐dependent confounding. In the applied literature, inverse probability of treatment weighting (IPTW) has been widely adopted to ...
Spreafico M.
europepmc +2 more sources
Trading Determinism for Time in Space Bounded Computations [PDF]
, 2016 Savitch showed in $1970$ that nondeterministic logspace (NL) is contained in deterministic $\mathcal{O}(\log^2 n)$ space but his algorithm requires quasipolynomial time.
Kallampally, Vivek Anand T +1 more
core +2 more sources
Using of coevolutionary algorithm on P2P networks [PDF]
Serbian Journal of Electrical Engineering, 2009 Multicast routing is the basic demand to provide QOS (Quality of service) in multimedia streaming on peer to peer networks. Making multicast trees optimizing their delay cost and considering nodal and links limited bandwidth (load balance constraints) is
Rezaee Alireza
doaj +1 more source
Alternation-Trading Proofs, Linear Programming, and Lower Bounds [PDF]
, 2010 A fertile area of recent research has demonstrated concrete polynomial time lower bounds for solving natural hard problems on restricted computational models.
Williams, Ryan
core +6 more sources
Controllable testing from nondeterministic finite state machines with multiple ports [PDF]
, 2011 Copyright @ 2011 IEEESome systems have physically distributed interfaces, called ports, at which they interact with their environment. We place a tester at each port and if the testers cannot directly communicate and there is no global clock then we are ...
Hierons, RM
core +1 more source
Signal processing of heart signals for the quantification of non-deterministic events
BioMedical Engineering OnLine, 2011 Background Heart signals represent an important way to evaluate cardiovascular function and often what is desired is to quantify the level of some signal of interest against the louder backdrop of the beating of the heart itself.
Baddour Natalie, Millette Véronique
doaj +1 more source
International Journal of Computational Intelligence Systems, 2021 The permutation flow shop scheduling problem (PFSSP) is a typical production scheduling problem and it has been proved to be a nondeterministic polynomial (NP-hard) problem when its scale is larger than 3.
Jiang Li +5 more
doaj +1 more source
Nondeterministic versus probabilistic linear search algorithms [PDF]
26th Annual Symposium on Foundations of Computer Science (sfcs 1985), 1985 The "component counting lower bound" known for deterministic linear search algorithms (LSA's) also holds for their probabilistic versions (PLSA's) for many problems, even if two-sided error is allowed, and if one does not charge for probabilistic choice. This implies lower bounds on PLSA's for e.g.
openaire +2 more sources
Pebbling, Entropy and Branching Program Size Lower Bounds [PDF]
, 2013 We contribute to the program of proving lower bounds on the size of branching programs solving the Tree Evaluation Problem introduced by Cook et. al. (2012).
Komarath, Balagopal, N, Jayalal Sarma M.
core +4 more sources
Efficient reduction of nondeterministic automata with application to language inclusion testing [PDF]
Logical Methods in Computer Science, 2019 We present efficient algorithms to reduce the size of nondeterministic B\"uchi word automata (NBA) and nondeterministic finite word automata (NFA), while retaining their languages.
Lorenzo Clemente, Richard Mayr
doaj +1 more source