In this paper, we propose a new approach, called lemma-reusing, for accelerating SAT based planning and scheduling. Generally, SAT based approaches generate a sequence of SAT prob...
While searching the web, the user is often confronted by a great number of results, generally displayed in a list which is sorted according to the relevance of the results. Facing...
Nicolas Bonnel, Vincent Lemaire, Alexandre Cotarma...
Generalized Vickrey mechanisms have received wide attention in the literature because they are efficient and strategyproof, i.e. truthful bidding is optimal whatever the bids of o...
Computer games are one of the most successful application domains in the history of interactive systems. This success has come despite the fact that games were ‘separated at bir...
Jeff Dyck, David Pinelle, Barry Brown, Carl Gutwin
Speculative execution of information gathering plans can dramatically reduce the effect of source I/O latencies on overall performance. However, the utility of speculation is clos...