A new algorithm for Boolean operations on general planar polygons is presented. It is available for general planar polygons (manifold or non-manifold, with or without holes). Edge...
d on Dung’s [4] abstract argumentation system • arguments: trees of chained defeasible inferences • aim: determine the status of a query given a belief base • incorporation...
Cognitive radio is an enabling technology that allows unlicensed users to opportunistically access the spectrum in order to enhance the spectrum efficiency. In this paper, we cons...
External regret compares the performance of an online algorithm, selecting among N actions, to the performance of the best of those actions in hindsight. Internal regret compares ...
Reasoning about program equivalence is one of the oldest problems in semantics. In recent years, useful techniques have been developed, based on bisimulations and logical relation...