Sciweavers

174 search results - page 30 / 35
» Monotonicity in Calculational Proofs
Sort
View
JACM
2007
84views more  JACM 2007»
13 years 7 months ago
Polymorphic higher-order recursive path orderings
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by defining a family of recursive path orderings for terms of a typed ...
Jean-Pierre Jouannaud, Albert Rubio
TOPLAS
2008
81views more  TOPLAS 2008»
13 years 7 months ago
Size-change termination with difference constraints
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
Amir M. Ben-Amram
JELIA
2010
Springer
13 years 5 months ago
Stable Belief Sets Revisited
Stable belief sets were introduced by R. Stalnaker in the early ’80s, as a formal representation of the epistemic state for an ideal introspective agent. This notion motivated M...
Costas D. Koutras, Yorgos Zikos

Publication
130views
15 years 5 months ago
General Weighted Fairness and its Support in Explicit Rate Switch Algorithms
This paper gives a new definition of general weighted (GW) fairness and shows how this can achieve various fairness definitions, such as those mentioned in the ATM Forum TM 4.0 spe...
Bobby Vandalore, Sonia Fahmy, Raj Jain, Rohit Goya...
ICC
2009
IEEE
114views Communications» more  ICC 2009»
14 years 2 months ago
Distributed Gradient Based Gain Allocation for Coherent Multiuser AF Relaying Networks
—A set of distributed non-cooperating relay antennas is known to be capable of orthogonalizing multiple sourcedestination pairs in space by coherent amplify-and-forward (AF) rela...
Celal Esli, Jörg Wagner, Armin Wittneben