Displaying similar documents to “More flexible radial layout.”

Pickup and delivery problem with split demand and transfers

Jan Pelikán (2013)

Kybernetika

Similarity:

We deal with a logistic problem motivated by a case study from a company dealing with inland transportation of piece goods in regular cycles. The problem consists in transportation of goods among regional centres – hubs of a network. Demands on transportation are contained in a matrix of flows of goods between pairs of hubs. The transport is performed by vehicles covering the shipping demands and the task is to design a cyclical route and to place a depot for each vehicle. The route...

Discriminating between causal structures in Bayesian Networks given partial observations

Philipp Moritz, Jörg Reichardt, Nihat Ay (2014)

Kybernetika

Similarity:

Given a fixed dependency graph G that describes a Bayesian network of binary variables X 1 , ⋯ , X n , our main result is a tight bound on the mutual information I c ( Y 1 , ⋯ , Y k ) = ∑ j = 1 k H ( Y j ) / c - H ( Y 1 , ⋯ , Y k ) of an observed subset Y 1 , ⋯ , Y k of the variables X 1 , ⋯ , X n . Our bound depends on certain quantities that can be computed from the connective structure of the nodes in G . Thus it allows to discriminate between different dependency graphs for a probability distribution, as we show from numerical experiments.