Sciweavers

59 search results - page 8 / 12
» cp 2009
Sort
View
CP
2009
Springer
14 years 8 months ago
Asynchronous Inter-Level Forward-Checking for DisCSPs
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...
CP
2009
Springer
14 years 2 months ago
Using Relaxations in Maximum Density Still Life
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...
CIE
2009
Springer
14 years 2 months ago
Cutting Planes and the Parameter Cutwidth
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 ...
Stefan S. Dantchev, Barnaby Martin
ICQT
2009
203views Optimization» more  ICQT 2009»
13 years 5 months ago
Price Setting in Two-Sided Markets for Internet Connectivity
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...
Thorsten Hau, Walter Brenner
CP
2009
Springer
14 years 8 months ago
Minimising Decision Tree Size as Combinatorial Optimisation
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...