Abstract. In logic programming, dynamic scheduling refers to a situation where the selection of the atom in each resolution (computation) step is determined at runtime, as opposed ...
Abstract. We introduce a compositional characterization of the operational semantics of equational Horn programs. Then we show that this semantics and the standard operational sema...
Multi Agent Based Simulation (MABS) has been used mostly in purely social contexts. However, compared to other approaches, e.g., traditional discrete event simulation, object-orien...
A contract algorithm is an algorithm which is given, as part of its input, a specified amount of allowable computation time. In contrast, interruptible algorithms may be interrupt...
We study principled methods for incorporating user utility into the selection of sponsored search ads. We describe variations of the GSP allocation/pricing mechanism that accommod...