Results 11  20
of
2,160
Optimal Placement for MultiTerminal Nets
"... In the general multiterminal placement problem we have to place tbe terminals of n multiterminal nets in aoy of a number of given positions in a channel. The positions for tbe terminals must be chosen so that tbe connections made by a routing algorithm (which follows the placement) require a chan ..."
Abstract
 Add to MetaCart
In the general multiterminal placement problem we have to place tbe terminals of n multiterminal nets in aoy of a number of given positions in a channel. The positions for tbe terminals must be chosen so that tbe connections made by a routing algorithm (which follows the placement) require a
Hamiltonian approach to multiterminal hybrid structures
, 2008
"... We derive a microscopic transport theory of multiterminal hybrid structures in which a superconductor is connected to several spinpolarized electrodes. We discuss the non perturbative physics of extended contacts. It is shown that the physics of extended contacts can be well represented by averagin ..."
Abstract
 Add to MetaCart
by averaging out the phase of the electronic wave function. The maximal conductance of a twochannel contact is finite and proportional to (e 2 /h)(a0/D) 2 exp [−D/ξ(ω ∗)], where D is the distance between the contacts, a0 the lattice spacing, ξ(ω) is the coherence length, and ω ∗ is the crossover frequency
Concurrent Decomposition of Multiterminal BDDs1
"... The paper deals with the problem of decomposition of logic functions and their implementation in a form of Multi Terminal Binary Decision Diagrams (MTBDD). The new logic decomposition method and the implementation style, called concurrent decomposition, introduced in the paper leads to a compact VLS ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The paper deals with the problem of decomposition of logic functions and their implementation in a form of Multi Terminal Binary Decision Diagrams (MTBDD). The new logic decomposition method and the implementation style, called concurrent decomposition, introduced in the paper leads to a compact
When trees collide: An approximation algorithm for the generalized Steiner problem on networks
, 1994
"... We give the first approximation algorithm for the generalized network Steiner problem, a problem in network design. An instance consists of a network with linkcosts and, for each pair fi; jg of nodes, an edgeconnectivity requirement r ij . The goal is to find a minimumcost network using the a ..."
Abstract

Cited by 256 (39 self)
 Add to MetaCart
the available links and satisfying the requirements. Our algorithm outputs a solution whose cost is within 2dlog 2 (r + 1)e of optimal, where r is the highest requirement value. In the course of proving the performance guarantee, we prove a combinatorial minmax approximate equality relating minimum
On the Characterization of Multiterminal Nets in Computer Systems
, 1997
"... Important layout properties of electronic designs include space requirements, delay constraints, interconnection length values, and power dissipation. A reliable estimation of those properties is essential for improving placement and routing techniques. Previous work on estimating design properties ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
has never taken multiterminal nets into account. All nets were assumed to be 2terminal nets. In this report we aim at characterizing multiterminal nets in computer systems. We will develop a model for the behaviour of multiterminal nets during the partitioning process. The resulting distribution
Applications of MultiTerminal Binary Decision Diagrams
 IFIP WG 10.5 Workshop on Applications of the ReedMuller Expansion in Circuit Design
, 1995
"... Functions that map boolean vectors into the integers are important for the design and verification of arithmetic circuits. MTBDDs and BMDs have been proposed for representing this class of functions. We discuss the relationship between these methods and describe a generalization called hybrid decisi ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
Functions that map boolean vectors into the integers are important for the design and verification of arithmetic circuits. MTBDDs and BMDs have been proposed for representing this class of functions. We discuss the relationship between these methods and describe a generalization called hybrid
1 Converses For Discrete Memoryless Multiterminal Networks
, 2010
"... In this paper we show that the “potential function method ” can provide a unified framework for proving converses for problems of determining the rate region of multiterminal communication networks. In this method, for a given network structure, we simultaneously consider all possible networks compa ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
of functions of dependent sources over a discrete memoryless multiterminal network; (2) we generalize the outer bound part of the recent result of Maric, Yates and Kramer on strong interference channels with a common message to include dependent sources; and (3) we simplify the recent outer bound of Liang
Lineartime Algorithms for Multiterminal Flows in Trees
"... In this paper, we study the problem of finding a multiflow which maximizes the sum of flow values between every two terminals in an undirected tree with a nonnegative edge capacity and a set of terminals. We show that a multiflow in an undirected tree can be characterized by a local structure, calle ..."
Abstract
 Add to MetaCart
In this paper, we study the problem of finding a multiflow which maximizes the sum of flow values between every two terminals in an undirected tree with a nonnegative edge capacity and a set of terminals. We show that a multiflow in an undirected tree can be characterized by a local structure
Bounds on Achievable Rates for General MultiTerminal Networks With Practical Constraints
 In Proc. of 2nd International Workshop on Information Processing (IPSN
, 2003
"... We consider the problem of communication in a general multiterminal network where each node of the network is a potential sender or receiver (or both) but it cannot do both functions together. ..."
Abstract

Cited by 35 (7 self)
 Add to MetaCart
We consider the problem of communication in a general multiterminal network where each node of the network is a potential sender or receiver (or both) but it cannot do both functions together.
Results 11  20
of
2,160