Estimating the probability of meeting a deadline in schedules and plans (Q2321333): Difference between revisions

@@ Property / OpenAlex ID @@
+W2954015630
@@ Property / OpenAlex ID: W2954015630 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.01327
@@ Property / arXiv ID: 1503.01327 / rank @@
+Normal rank
@@ Property / cites work @@
+Project scheduling under uncertainty: survey and research potentials
+Normal rank
@@ Property / cites work @@
+Q3624051
@@ Property / cites work: Q3624051 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4449309
@@ Property / cites work: Q4449309 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4542179
@@ Property / cites work: Q4542179 / rank @@
+Normal rank
@@ Property / cites work @@
+Disregarding Duration Uncertainty in Partial Order Schedules? Yes, We Can!
+Normal rank
@@ Property / cites work @@
+Q3789107
@@ Property / cites work: Q3789107 / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Complexity
@@ Property / cites work: Computational Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Q2747613
@@ Property / cites work: Q2747613 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating probabilistic inference in Bayesian belief networks is NP- hard
+Normal rank
@@ Property / cites work @@
+The computational complexity of probabilistic inference using Bayesian belief networks
+Normal rank
@@ Property / cites work @@
+Probabilistic inference in multiply connected belief networks using loop cutsets
+Normal rank
@@ Property / cites work @@
+Treewidth: Characterizations, Applications, and Computations
+Normal rank
@@ Property / cites work @@
+Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks
+Normal rank
@@ Property / cites work @@
+Complexity results for HTN planning
@@ Property / cites work: Complexity results for HTN planning / rank @@
+Normal rank
@@ Property / cites work @@
+Q3993164
@@ Property / cites work: Q3993164 / rank @@
+Normal rank
@@ Property / cites work @@
+Average execution times of series-parallel networks
+Normal rank
@@ Property / cites work @@
+Algorithms for computing the distributions of sums of discrete random variables
+Normal rank
@@ Property / cites work @@
+On computing the distribution function for the Poisson binomial distribution
+Normal rank
@@ Property / cites work @@
+Discrete random bounds for general random variables and applications to reliability
+Normal rank
@@ Property / cites work @@
+Generating the maximum of independent identically distributed random variables
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for Knapsack Problems
+Normal rank
@@ Property / cites work @@
+An FPTAS for #Knapsack and Related Counting Problems
+Normal rank
@@ Property / cites work @@
+Approximate counting by dynamic programming
@@ Property / cites work: Approximate counting by dynamic programming / rank @@
+Normal rank
@@ Property / cites work @@
+Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions
+Normal rank
@@ Property / cites work @@
+Importance sampling algorithms for Bayesian networks: principles and performance
+Normal rank
@@ Property / cites work @@
+Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
+Normal rank
@@ Property / Wikidata QID @@
+Q127581036
@@ Property / Wikidata QID: Q127581036 / rank @@
+Normal rank