Filters








16,739 Hits in 2.5 sec

Probabilistic Combinatorial Optimization [chapter]

Cécile Murat, Vangelis Th. Paschos
2013 Paradigms of Combinatorial Optimization  
Probabilistic longest path in terms of vertices 100 4.2. Probabilistic longest path in terms of arcs 102 4.2.1. An interesting algebraic expression 104 4.2.2.  ...  Proofs of the results 91 3.6.1. Proofof Theorem 3.3 91 3.6.2. On the the bounds obtained in Theorem 3.3 93 Chapter 4. The Probabilistic Longest Path 99 4.1.  ... 
doi:10.1002/9781118600207.ch18 fatcat:7h7qd6ufafgyhjejpc6hdm2eou

Probabilistic loop scheduling for applications with uncertain execution time

S. Tongsima, E.H.-M. Sha, C. Chantrapornchai, D.R. Surma, N.L. Passos
2000 IEEE transactions on computers  
Experimental results show that probabilistic retiming consistently produces a graph with a smaller longest path computation time for a given confidence level, as compared with the traditional retiming  ...  Two novel algorithms, called probabilistic retiming and probabilistic rotation scheduling, are developed for solving the underlying non-resource and resource constrained scheduling problems respectively  ...  Acknowledgment The research was partially supported by U.S. National Science Foundation Career Grant MIP 95-01006.  ... 
doi:10.1109/12.822565 fatcat:mhwvd2ylqvbk5f5g7xnkoivqta

A Probabilistic Ant-based Heuristic for the Longest Simple Cycle Problem in Complex Networks [article]

David Chalupa, Phininder Balaghan, Ken A Hawick
2018 arXiv   pre-print
We propose a new probabilistic ant-based heuristic (ANTH-LS) for the longest simple cycle problem.  ...  For 6 out of our 22 real-world network test instances, ANTH-LS has obtained an improvement on the longest cycle ever found.  ...  In addition, one can also observe that the ant-based algorithm is the first A Probabilistic Ant-based Heuristic for the Longest Simple Cycle Problem in Complex Networks Table 1 : Computational results  ... 
arXiv:1801.09227v1 fatcat:5tikd3mmcncbvhiumvauzu6e2a

On the Comparison of Deterministic and Probabilistic WCET Estimation Techniques

Jaume Abella, Damien Hardy, Isabelle Puaut, Eduardo Quinones, Francisco J. Cazorla
2014 2014 26th Euromicro Conference on Real-Time Systems  
-Implicit Path Enumeration Technique (IPET) • ILP formulation of the WCET calculation problem • Linear programming solver • LRU, EoM… Probabilistic Timing Analysis (PTA) 12 Probabilistic  ...  Time Frequency Actual WCET Safe upper bound 10 Static Deterministic Timing Analysis (SDTA) T 1 T 2 T 3 T 4 T 5 T 6 T 7 • High-level analysis Longest execution path computation  ... 
doi:10.1109/ecrts.2014.16 dblp:conf/ecrts/AbellaHPQC14 fatcat:f6sl55hniva67ktzap34ih35d4

Expected convergence properties of BGP

R. Viswanathan, K.K. Sabnani, R.J. Holt, A.N. Netravali
2005 13TH IEEE International Conference on Network Protocols (ICNP'05)  
We introduce the notion of probabilistic safety as requiring the probability of convergence to be 1.  ...  For probabilistically safe configurations, we present procedures for computing their expected time to converge as well as the probability distribution on their convergence times.  ...  Acknowledgments The research of Robert Holt and Arun Netravali was supported in part by Bell Laboratories of Lucent Technologies.  ... 
doi:10.1109/icnp.2005.16 dblp:conf/icnp/ViswanathanSHN05 fatcat:u66qgy2b5fcstokdkjrtzq3zq4

Expected convergence properties of BGP

Ramesh Viswanathan, Krishan K. Sabnani, Robert J. Holt, Arun N. Netravali
2011 Computer Networks  
We introduce the notion of probabilistic safety as requiring the probability of convergence to be 1.  ...  For probabilistically safe configurations, we present procedures for computing their expected time to converge as well as the probability distribution on their convergence times.  ...  Acknowledgments The research of Robert Holt and Arun Netravali was supported in part by Bell Laboratories of Lucent Technologies.  ... 
doi:10.1016/j.comnet.2011.02.003 fatcat:v33qivk6w5cs3c2ksgi5w3ajhy

Fast statistical timing analysis handling arbitrary delay correlations

Michael Orshansky, Arnab Bandyopadhyay
2004 Proceedings of the 41st annual conference on Design automation - DAC '04  
An efficient algorithm to compute the bounds is based on a PERT-like single traversal of the sub-graph containing the set of N deterministically longest paths.  ...  Because the analytical computation of an exact cumulative distribution function for a probabilistic graph with arbitrary distributions is infeasible, we find tight upper and lower bounds on the true cumulative  ...  The exact distribution of the longest path through a probabilistic timing graph appears intractable regardless of the assumed dependence structure [11] .  ... 
doi:10.1145/996566.996664 dblp:conf/dac/OrshanskyB04 fatcat:fnxmpvvnwbax7jgs3xqjnr2dye

Page 609 of Mathematical Reviews Vol. 57, Issue 2 [page]

1979 Mathematical Reviews  
S. 4618 An information-theoretic lower bound for the longest common subsequence problem. Information Processing Lett. 7 (1978), no. 1, 40-41.  ...  The problem of fmding the longest common subsequence (LCS) of two given string: of length n is investigated from the point of view of its complexity, It is assumed that the size of the alphabet is unrestricted  ... 

Conjunctive Queries on Probabilistic Graphs: Combined Complexity [article]

Antoine Amarilli, Mikaël Monet, Pierre Senellart
2017 arXiv   pre-print
version of the graph homomorphism problem, or of a constraint satisfaction problem (CSP) variant.  ...  This paper proposes the first general study of the combined complexity of conjunctive query evaluation on probabilistic instances over binary signatures, which we can alternatively phrase as a probabilistic  ...  We are grateful to Florent Capelli for pointing out to us the connection to β-acyclic instances and suggesting the idea used in the proof of Proposition 4.10, and to Tyson Williams for explaining the connection  ... 
arXiv:1703.03201v1 fatcat:zezal3pjebed7n3xdxs3jvpqua

Defense against DoS attacks by multipath routing using the ACO algorithm

Takuya Shindo, Tomotaka Kimura, Takefumi Hiraguri
2021 IEICE Communications Express  
The ACO algorithm is used to distribute the routing path.  ...  The effectiveness of this proposed scheme is confirmed through computer simulations, which shows that the throughput can be adjusted by the selection probability of the longest route and the number of  ...  The ACO algorithm is typically used to probabilistically search for the shortest path based on the foraging behavior of ants.  ... 
doi:10.1587/comex.2021col0018 fatcat:zqdn6jyltvewpnz6tbd45kpgde

Constructing Longest Lifetime Route in Mobile Ad-hoc Networks

Fredrick Mtenzi, Yingyu Wan
2005 Journal of Computer Science  
In this paper, we study the problem of how to construct a route with the longest lifetime for any given one-to-one communication request as a solution to link breakage in MANET.  ...  If two hosts are not located in each other's transmission range, intermediate relay hosts must be employed as bridges to build communication paths.  ...  request (s,t), let ∆ be the delay on Model mobile ad hoc networks as a weighted graph the problem is to find a path p from s to t such that the lifetime of p is the longest.  ... 
doi:10.3844/jcssp.2005.77.79 fatcat:gqitpibz3fc7xm6g3saynf64oq

Interface optimization for improved routability in chip-package-board co-design

Tilo Meister, Jens Lienig, Gisbert Thomke
2011 International Workshop on System Level Interconnect Prediction  
In this paper we provide a comprehensive, fast method to evaluate the routability of interfaces in hierarchical systems based on a new probabilistic routability prediction.  ...  Specifically, a fast and finegrained evaluation of routability that considers all requirements between the different hierarchy levels is missing.  ...  This longest path follows the outer border of S n .  ... 
doi:10.1109/slip.2011.6135430 dblp:conf/slip/MeisterLT11 fatcat:e2qlio3sd5gkri4w3khxhxwx54

The complexity of approximating MAPs for belief networks with bounded probabilities

Ashraf M. Abdelbar, Stephen T. Hedetniemi, Sandra M. Hedetniemi
2000 Artificial Intelligence  
Probabilistic inference and maximum a posteriori (MAP) explanation are two important and related problems on Bayesian belief networks.  ...  within the range [l, u] for any 0 l < 0.5 < u 1.  ...  The results of this paper apply to belief networks in which every longest directed path has length 1, i.e., bipartite belief networks, without any assumptions on specification of distributions.  ... 
doi:10.1016/s0004-3702(00)00076-x fatcat:lx7zjvac55fdpg5mkx2zio453e

Optimizing insuring critical path problem under uncertainty based on GP-BPSO algorithm

Zhenhong Li, Bo Li
2017 Scientia Iranica. International Journal of Science and Technology  
This study considers a novel class of bi-level fuzzy random programming problems of insuring critical path.  ...  Then, we use Sample Average Approximation (SAA) method for reformulating the equivalent random programming subproblems as the approximation problems.  ...  Kaur and Kumar [17] presented a novel approach to nding the best solution in the fuzzy longest path problem.  ... 
doi:10.24200/sci.2017.4587 fatcat:2u5p53c6azcd5c3jr7uz44abq4

Growth of Random Trees by Leaf Attachment [article]

Nomvelo Sibisi
2020 arXiv   pre-print
We take such connectivity to be induced by the merging of directed ordered paths from leaves to the root.  ...  We study the growth of a time-ordered rooted tree by probabilistic attachment of new vertices to leaves. We construct a likelihood function of the leaves based on the connectivity of the tree.  ...  We thank Sibusiso Sibisi for helpful discussions and input on the C++ code and the use of the gnuplot graphing package for the computational examples.  ... 
arXiv:2010.05589v3 fatcat:edmxmpuc3jhj7lsatnzhdrapyq
« Previous Showing results 1 — 15 out of 16,739 results