Sciweavers

170 search results - page 8 / 34
» A Bounding Quantifier
Sort
View
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
14 years 2 months ago
On the Power of Uniform Power: Capacity of Wireless Networks with Bounded Resources
Abstract. The throughput capacity of arbitrary wireless networks under the physical Signal to Interference Plus Noise Ratio (SINR) model has received a greater deal of attention in...
Chen Avin, Zvi Lotker, Yvonne Anne Pignolet
APVIS
2011
12 years 7 months ago
Edge maps: Representing flow with bounded error
Robust analysis of vector fields has been established as an important tool for deriving insights from the complex systems these fields model. Many analysis techniques rely on co...
Harsh Bhatia, Shreeraj Jadhav, Peer-Timo Bremer, G...
TWC
2010
13 years 2 months ago
Random access transport capacity
Abstract--We develop a new metric for quantifying end-toend throughput in multihop wireless networks, which we term random access transport capacity, since the interference model p...
Jeffrey G. Andrews, Steven Weber, Marios Kountouri...
CAV
2008
Springer
161views Hardware» more  CAV 2008»
13 years 9 months ago
Constraint-Based Approach for Analysis of Hybrid Systems
Abstract. This paper presents a constraint-based technique for discovering a rich class of inductive invariants (boolean combinations of polynomial inequalities of bounded degree) ...
Sumit Gulwani, Ashish Tiwari
CADE
2005
Springer
14 years 7 months ago
An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard