Sciweavers

1716 search results - page 91 / 344
» Proving Conditional Termination
Sort
View
CHARME
2003
Springer
100views Hardware» more  CHARME 2003»
14 years 2 months ago
Inductive Assertions and Operational Semantics
This paper shows how classic inductive assertions can be used in conjunction with an operational semantics to prove partial correctness properties of programs. The method imposes o...
J. Strother Moore
VTC
2008
IEEE
142views Communications» more  VTC 2008»
14 years 3 months ago
Fairness Assessment of the Adaptive Token Bank Fair Queuing Scheduling Algorithm
Abstract—Adaptive Token Bank Fair Queuing (ATBFQ) algorithm has been proposed as a cross-layer scheduling technique for 4G wireless systems recently. This algorithm takes higher ...
Feroz A. Bokhari, Halim Yanikomeroglu, William K. ...
VTC
2007
IEEE
14 years 3 months ago
Decision Directed Channel Estimation Employing Projection Approximation Subspace Tracking
— The attainable capacity and integrity of a state-of-the-art broadband multi-carrier communication system is highly sensitive to the accuracy of the information available concer...
Jos Akhtman, Lajos Hanzo
MP
2006
103views more  MP 2006»
13 years 8 months ago
Assessing solution quality in stochastic programs
Determining if a solution is optimal or near optimal is fundamental in optimization theory, algorithms, and computation. For instance, Karush-Kuhn-Tucker conditions provide necessa...
Güzin Bayraksan, David P. Morton
FOCS
2009
IEEE
14 years 3 months ago
Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
Ankur Moitra