Eliciting vague but proper maximal entropy priors in Bayesian experiments
Bayesian inference, Expert opinion, Kullback–Leibler distance, Shannon’s entropy, Noninformative priors, Channel coding, Sensitivity study, Weibull, 65K05, 90C35,
Nicolas Bousquet
core +1 more source
Central hubs prediction for bio networks by directed hypergraph - GA with validation to COVID-19 PPI. [PDF]
Pattern Recognit Lett, 2022 Gopalakrishnan S +4 more
europepmc +1 more source
Polynomial Time Algorithm for Determining Max-Min Paths in Networks and Solving Zero Value Cyclic Games [PDF]
, 2005 We study the max-min paths problem, which represents a game version of the shortest and the longest paths problem in a weighted directed graph. In this problem the vertex set V of the weighted directed graph G=(V,E) is divided into two disjoint subsets ...
Dmitrii D. Lozovanu
core +1 more source
Fiduciary Responsibility and the Green Energy Act, 2009 (Ontario, Canada). [PDF]
Environ Justice, 2021 Tsuji SRJ.
europepmc +1 more source
On the Lovasz O-number of Almost Regular Graphs With Application to Erdos-Renyi Graphs [PDF]
AMS classifications: 05C69; 90C35; 90C22;Erdos-Renyi graph;stability number;Lovasz O-number;Schrijver O-number;C*-algebra;semidefinite ...
Klerk, E. de +3 more
core
Linear programming relaxations of the mixed postman problem”, Morfismos 9
, 2005 The mixed postman problem consists of finding a minimum cost tour of a connected mixed graph traversing all its vertices, edges, and arcs at least once.
Francisco Javier Zaragoza Martínez
core
Interior Point Algorithms For Network Flow Problems
, 1996 . Computational algorithms for the solution of network flow problems are of great practical significance. In the last decade, a new class of computationally efficient algorithms, based on the interior point method, has been proposed and applied to solve ...
Mauricio G.C. Resende, Panos M. Pardalos
core
On the neighbour vulnerability of recursive graphs
, 2006 The vulnerability of the communication network measures the resistance of the network to disruption of operation after the failure of certain stations or communication links.
Aytaç A., Dündar P.
core
The shortest path problem in the stochastic networks with unstable topology. [PDF]
Springerplus, 2016 Shirdel GH, Abdolhosseinzadeh M.
europepmc +1 more source
A genetic algorithm for the arrival probability in the stochastic networks. [PDF]
Springerplus, 2016 Shirdel GH, Abdolhosseinzadeh M.
europepmc +1 more source