The evaluation of incomplete satisfiability solvers depends critically on the availability of hard satisfiable instances. A plausible source of such instances consists of random k...
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance boo...
We present new results on the problem of finding an enclosing rectangle of minimum area that will contain a given a set of rectangles. Many simple scheduling tasks can be modelled...
Abstract. This paper deals with the issue of learning in multi-agent systems (MAS). Particularly, we are interested in BDI (Belief, Desire, Intention) agents. Despite the relevance...
In this paper, we derive optimal bidding strategies for a global bidder who participates in multiple, simultaneous second-price auctions with perfect substitutes. We first conside...
Enrico H. Gerding, Rajdeep K. Dash, David C. K. Yu...