• No results found

Exact systems for non-tree networks

Simulating strongly correlated quantum systems with tree tensor networks

Simulating strongly correlated quantum systems with tree tensor networks

... a tree-tensor-network-based method to study strongly correlated systems with non- local interactions in higher ...such systems, the spatial topology of DMRG-based methods allows efficient ...

12

Exact Solutions for Classic Gene Tree Parsimony Problems

Exact Solutions for Classic Gene Tree Parsimony Problems

... from non-trivial instances to date. Since the exact al- gorithms can compute species trees with up to 22 taxa in reasonable time, they can provide new perspectives on phy- logenetic questions that ...

6

Combining tree-based and dynamical systems for the inference of gene regulatory networks

Combining tree-based and dynamical systems for the inference of gene regulatory networks

... of networks of hundreds of genes and have consistently achieved state-of-the-art reconstruction performance in comparative evaluations ( Marbach et ...dynamical systems and cannot be used for prediction in ...

9

Exact analysis of TTL cache networks

Exact analysis of TTL cache networks

... cache networks by developing two exact methods with orthogonal generality and computational ...line networks under renewal requests to the broad class of caching policies whereby evictions are driven ...

27

Exact Bayesian Structure Discovery in Bayesian Networks

Exact Bayesian Structure Discovery in Bayesian Networks

... One way to view this reduction from ordered sets to unordered sets is to consider a permutation tree. A permutation tree of V = {1, . . . , n} is a rooted (directed) tree with n levels. Any node at ...

25

On bounding exact models of epidemic spread on networks

On bounding exact models of epidemic spread on networks

... are non-negatively, and I − I and S − S pairs are non-positively correlated [ 7 ], that is we have for any i and j that hSi I ji ≤ hSiihIji, hIi I j i ≥ hIiihIji, hSi S ji ≥ ...

17

Tree topology networks in WebRTC

Tree topology networks in WebRTC

... As can be seen in Table 9 the upload speed required by the supernodes for conferences with three participants is quite similar to the requirements for every node in the reference case. However, when a supernode is ...

55

A systems biology approach to non-coding RNAs: the networks of cancer

A systems biology approach to non-coding RNAs: the networks of cancer

... The expression values were preprocessed with Gene Pattern to only filter out non varying miRNAs, according to the following parameters: #filter.flag = filter (Variation filter and thresholding flag); ...

198

Routing Algorithm for Wireless Multi-hop Networks with Tree Topology for Smart Meter Systems

Routing Algorithm for Wireless Multi-hop Networks with Tree Topology for Smart Meter Systems

... center gray circle shows a new node. The upper figure shows the situation that has added a new node to the network which has completed the routing. The below left figure shows the situation that has made routing by the ...

5

Exact algorithms for computing the tree edit distance between unordered trees

Exact algorithms for computing the tree edit distance between unordered trees

... Analysis of the space complexity can be done in the same way as in the proof of Theorem 1. Theorem 2. FpDist ( T 1 , T 2 , k ) decides whether or not dist ( T 1 , T 2 ) ≤ k holds in O ( 2 . 62 k · poly ( n )) time and O ...

13

Efficient and scalable exact inference algorithms for Bayesian networks

Efficient and scalable exact inference algorithms for Bayesian networks

... Bayesian networks continue to gain ‘market share’ in the diverse world of intelligent ...expert systems, many solutions were criticized due to unwieldy and unsubstantiated heuris- tics which failed when ...

173

Exact Combinatorial Optimization with Graph Convolutional Neural Networks

Exact Combinatorial Optimization with Graph Convolutional Neural Networks

... also non discrete ...an exact solution, these kind of problems are typically tackled with the branch-and-bound algorithm which is based on the decomposition of the main problem in many smaller and simpler ...

95

Tree Networks to Assess Financial Contagion

Tree Networks to Assess Financial Contagion

... An extension of the model formulation includes a dynamic transition in the global market indicators which can be proxied by actual global financial and macroeconomic indicators rather than a factor decomposition of the ...

22

Exact Convex Modeling of the Optimal Power Flow for the Operation and Planning of Active Distribution Networks with Energy Storage Systems

Exact Convex Modeling of the Optimal Power Flow for the Operation and Planning of Active Distribution Networks with Energy Storage Systems

... 44.5.1 Solution methodologies The formulated problem is a Mixed Integer Quadratically Constrained Quadratic Programming (MIQCQP). This type of optimization problems can be solved using state- of-the-art commercial ...

209

Building Distributed Systems with Non-Volatile Main Memories and RDMA Networks

Building Distributed Systems with Non-Volatile Main Memories and RDMA Networks

... [74] Stanko Novakovic, Yizhou Shan, Aasheesh Kolli, Michael Cui, Yiying Zhang, Haggai Eran, Boris Pismenny, Liran Liss, Michael Wei, Dan Tsafrir, and Marcos Aguilera. Storm: A fast transactional dataplane for remote data ...

127

E2-quasi-exact solvability for non-Hermitian models

E2-quasi-exact solvability for non-Hermitian models

... mechanical systems the determination of explicit and ideally exact solutions to the associated eigenvalue problem is either part of the key aims or at least essential ...Hamiltonian systems form a ...

22

Exact analytical solutions for time-dependent Hermitian Hamiltonian systems from static unobservable non-Hermitian Hamiltonians

Exact analytical solutions for time-dependent Hermitian Hamiltonian systems from static unobservable non-Hermitian Hamiltonians

... obtain exact analytical solutions to the time-dependent Schr¨ odinger equations involving explicit time-dependent Hermitian Hamitonians from solutions to time- independent non-Hermitian Hamiltonian ...

6

Exact analytical solutions for time-dependent Hermitian Hamiltonian systems from static unobservable non-Hermitian Hamiltonians

Exact analytical solutions for time-dependent Hermitian Hamiltonian systems from static unobservable non-Hermitian Hamiltonians

... consistent non-Hermitian systems with time-dependent metric ...the non-Hermitian setting many operators, such as for instance the standard posi- tion or momentum operator, become mere auxiliary op- ...

6

Augmenting String to Tree and Tree to String Translation with Non Syntactic Phrases

Augmenting String to Tree and Tree to String Translation with Non Syntactic Phrases

... and tree-to-string translation systems with phrase pairs that are not induced in the syntax-based ...syntactic tree annotation. Non-syntactic phrases are added as rules to the baseline ...

13

An exact algorithm for design of content delivery networks in MPLS environment

An exact algorithm for design of content delivery networks in MPLS environment

... 7. Conclusion This paper deals with the problem of replica location in a content delivery network. We have presented and discussed basic information on CDNs and MPLS. We have formulated an optimisation problem of replica ...

10

Show all 10000 documents...

Related subjects