Sciweavers

1716 search results - page 85 / 344
» Proving Conditional Termination
Sort
View
NETWORK
2007
121views more  NETWORK 2007»
13 years 8 months ago
Toward Efficient Service-Level QoS Provisioning in Large-Scale 802.11-Based Networks
Along with recent advances in mobile networking and portable computing technologies, there is a trend in the telecommunications industry toward the development of efficient ubiqui...
Tarik Taleb, Abdelhamid Nafaa, Liam Murphy, Kazuo ...
CADE
2009
Springer
14 years 9 months ago
Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic
Abstract. Polynomial constraint-solving plays a prominent role in several areas of engineering and software verification. In particular, polynomial constraint solving has a long an...
Albert Rubio, Cristina Borralleras, Enric Rodr&iac...
ISCC
2007
IEEE
126views Communications» more  ISCC 2007»
14 years 3 months ago
VoIP Communications in Wireless Ad-hoc Network with Gateways
In this paper, we investigate some of the issues that arise when mobile nodes engage voice connections with remote peers by using a wireless ad hoc network (MANET–cell) to acces...
Elena Fasolo, Federico Maguolo, Andrea Zanella, Mi...
GLOBECOM
2006
IEEE
14 years 2 months ago
An Empirical Study on Statistical Properties of GSM Telephone Call Arrivals
 We investigate the statistical properties of both originated and terminated call arrivals in sets of real GSM telephone traffic data (TIM, Italy), emphasizing results obtained ...
Stefano Bregni, Roberto Cioffi, Maurizio Decina
AISC
2008
Springer
13 years 10 months ago
Search Techniques for Rational Polynomial Orders
Polynomial interpretations are a standard technique used in almost all tools for proving termination of term rewrite systems (TRSs) automatically. Traditionally, one applies interp...
Carsten Fuhs, Rafael Navarro-Marset, Carsten Otto,...