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 ...
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 &...
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...
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...
—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...