We propose two new asynchronous algorithms for solving Distributed Constraint Satisfaction Problems (DisCSPs). The first algorithm, AFC-ng, is a nogood-based version of Asynchronou...
Redouane Ezzahir, Christian Bessiere, Mohamed Wahb...
The Maximum Density Sill-Life Problem is to fill an n × n board of cells with the maximum number of live cells so that the board is stable under the rules of Conway’s Game of L...
Geoffrey Chu, Peter J. Stuckey, Maria Garcia de la...
We introduce the parameter cutwidth for the Cutting Planes (CP) system of Gomory and Chv´atal. We provide linear lower bounds on cutwidth for two simple polytopes. Considering CP ...
Due to a lack of incentives, Internet peerings are a notorious bandwidth bottleneck. Through the use of direct interconnection and content delivery networks, content providers are...
Decision tree induction techniques attempt to find small trees that fit a training set of data. This preference for smaller trees, which provides a learning bias, is often justifie...
Christian Bessiere, Emmanuel Hebrard, Barry O'Sull...