In CP literature combinatorial design problems such as sport scheduling, Steiner systems, error-correcting codes and more, are typically solved using Finite Domain (FD) models desp...
This paper presents a method for finding and classifying objects within real-world scenes by using the activity of humans interacting with these objects to infer the object’s i...
Patrick Peursum, Svetha Venkatesh, Geoff A. W. Wes...
In this paper, we present a novel system for selling bundles of news items. Through the system, customers bargain with the seller over the price and quality of the delivered goods...
D. J. A. Somefun, Enrico Gerding, Sander M. Bohte,...
Open trading environments involve a type of peer-to-peer computing characterised by well-defined interaction protocols that are used by the traders and sometimes updated dynamicall...
Martin K. Purvis, Mariusz Nowostawski, Stephen Cra...
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...