Results 1  10
of
1,738,353
On Theoretical Upper Bounds for Routing Estimation
"... Abstract: Routing space estimation plays a crucial role in design automation of digital systems. We investigate the problem of estimating upper bounds for global routing of twoterminal nets in twodimensional arrays. We show the soundness of the bounds for both wiring space and total wirelength es ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract: Routing space estimation plays a crucial role in design automation of digital systems. We investigate the problem of estimating upper bounds for global routing of twoterminal nets in twodimensional arrays. We show the soundness of the bounds for both wiring space and total wire
A Theoretical Upper Bound for IPBased Floorplanning
"... Abstract. Floorplan is a crucial estimation task in the modern layout design of systems on chips. The paper presents a novel theoretical upper bound for slicing floorplans with soft modules. We show that, given a set of soft modules of total area Atotal, maximum area Amax, and shape flexibility r ≥ ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. Floorplan is a crucial estimation task in the modern layout design of systems on chips. The paper presents a novel theoretical upper bound for slicing floorplans with soft modules. We show that, given a set of soft modules of total area Atotal, maximum area Amax, and shape flexibility r
Theoretical upper bound on the mass of the LSP in the MNSSM
, 712
"... We study the neutralino sector of the Minimal Nonminimal Supersymmetric Standard Model (MNSSM) where the µ problem of the Minimal Supersymmetric Standard Model (MSSM) is solved without accompanying problems related with the appearance of domain walls. In the MNSSM as in the MSSM the lightest neutra ..."
Abstract
 Add to MetaCart
neutralino can be the absolutely stable lightest supersymmetric particle (LSP) providing a good candidate for the cold dark matter component of the Universe. In contrast with the MSSM the allowed range of the mass of the lightest neutralino in the MNSSM is limited. We establish the theoretical upper bound
Theoretical Upper Bounds on the Covering Radii of Boolean Functions
, 2004
"... We prove new upper bounds for the covering radii ρ(n) and ρB(n) of the first order ReedMuller code R(1, n). Although these bounds be actually theoretical, they improve the classical HellesethKløveMykkeltveit (H.K.M.) bound 2n−1 − 2n2−1. ..."
Abstract
 Add to MetaCart
We prove new upper bounds for the covering radii ρ(n) and ρB(n) of the first order ReedMuller code R(1, n). Although these bounds be actually theoretical, they improve the classical HellesethKløveMykkeltveit (H.K.M.) bound 2n−1 − 2n2−1.
An InformationTheoretic Upper Bound on the Length of the Shortest Proof
"... Consider a short theorem, i.e. one that can be written down using just a few symbols. Can its shortest proof be arbitrarily long? We answer this question in the negative. Inspired by arguments by Calude et al (1999) and Chaitin (1984) that construct an upper bound on the first counterexample of a Π1 ..."
Abstract
 Add to MetaCart
Consider a short theorem, i.e. one that can be written down using just a few symbols. Can its shortest proof be arbitrarily long? We answer this question in the negative. Inspired by arguments by Calude et al (1999) and Chaitin (1984) that construct an upper bound on the first counterexample of a Π
An InformationTheoretic Upper Bound on Planar Graphs Using WellOrderly Maps
, 2011
"... This chapter deals with compressed coding of graphs. We focus on planar graphs, a widely studied class of graphs. A planar graph is a graph that admits an embedding in the plane without edge crossings. Planar maps (class of embeddings of a planar graph) are easier to study than planar graphs, but a ..."
Abstract

Cited by 26 (3 self)
 Add to MetaCart
, but as a planar graph may admit an exponential number of maps, they give little information on graphs. In order to give an informationtheoretic upper bound on planar graphs, we introduce a definition of a quasicanonical embedding for planar graphs: wellorderly maps. This appears to be an useful tool
Information Theoretic Upper Bound on the Capacity of Wireless Backhaul Networks
"... Abstract—We derive an information theoretic upper bound on the capacity of a wireless backhaul network modeled as a classical random extended network, except that we assume the number of antennas at each base station (BS) also scales up as an arbitrary function of network size. The antenna scaling i ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract—We derive an information theoretic upper bound on the capacity of a wireless backhaul network modeled as a classical random extended network, except that we assume the number of antennas at each base station (BS) also scales up as an arbitrary function of network size. The antenna scaling
Hybrid Demand Oblivious Routing: Hypercubic Partitions and Theoretical Upper Bounds
"... Summary. Traditionally, network routing was optimized with respect to an expected traffic matrix, which left the network in a suboptimal state if user traffic did not match expectations. A demandoblivious routing is, contrarily, optimized with respect to all possible traffic matrices, obviating th ..."
Abstract
 Add to MetaCart
. However, our scheme did not provide a theoretical upper bound for the link overutilization. In this paper, we tackle the problem again from a different perspective. Based on a novel hypercubic partition of the demand space, we construct a new algorithm that readily delivers the theoretical bounds
Informationtheoretic upper bounds on the capacity of large extended ad hoc wireless networks
 IEEE Trans. on Information Theory
, 2005
"... Abstract—We derive an informationtheoretic upper bound on the rate per communication pair in a large ad hoc wireless network. We show that under minimal conditions on the attenuation due to the environment and for networks with a constant density of users, this rate tends to zero as the number of u ..."
Abstract

Cited by 68 (2 self)
 Add to MetaCart
Abstract—We derive an informationtheoretic upper bound on the rate per communication pair in a large ad hoc wireless network. We show that under minimal conditions on the attenuation due to the environment and for networks with a constant density of users, this rate tends to zero as the number
Results 1  10
of
1,738,353