Sciweavers

601 search results - page 50 / 121
» Quantified Equality Constraints
Sort
View
BROADNETS
2004
IEEE
14 years 21 days ago
Decoupling Packet Loss from Blocking in Proactive Reservation-Based Switching
We consider the maximization of network throughput in buffer-constrained optical networks using aggregate bandwidth allocation and reservation-based transmission control. Assuming...
Mahmoud Elhaddad, Rami G. Melhem, Taieb Znati
CPAIOR
2008
Springer
13 years 10 months ago
Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic
Abstract. The stochastic satisfiability modulo theories (SSMT) problem is a generalization of the SMT problem on existential and randomized (aka. stochastic) quantification over di...
Tino Teige, Martin Fränzle
VLSID
2002
IEEE
177views VLSI» more  VLSID 2002»
14 years 9 months ago
RTL-Datapath Verification using Integer Linear Programming
Satisfiability of complex word-level formulas often arises as a problem in formal verification of hardware designs described at the register transfer level (RTL). Even though most...
Raik Brinkmann, Rolf Drechsler
ICFP
2005
ACM
14 years 9 months ago
Combining programming with theorem proving
Applied Type System (ATS) is recently proposed as a framework for designing and formalizing (advanced) type systems in support of practical programming. In ATS, the definition of ...
Chiyan Chen, Hongwei Xi
INFOCOM
2008
IEEE
14 years 3 months ago
A Distributed Minimum-Distortion Routing Algorithm with In-Network Data Processing
—In many wired and wireless networks, nodes process input traffic to satisfy a network constraint (e.g. capacity constraints) and to increase the utility of data in the output ...
Ramin Khalili, James F. Kurose