Sciweavers

1844 search results - page 155 / 369
» Exploiting the Structure of Distributed Constraint Optimizat...
Sort
View
177
Voted
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
16 years 6 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
CC
2012
Springer
271views System Software» more  CC 2012»
14 years 2 months ago
Parallel Replication-Based Points-To Analysis
Pointer analysis is one of the most important static analyses during compilation. While several enhancements have been made to scale pointer analysis, the work on parallelizing the...
Sandeep Putta, Rupesh Nasre
ATAL
2009
Springer
16 years 26 days ago
Directed soft arc consistency in pseudo trees
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
Toshihiro Matsui, Marius-Calin Silaghi, Katsutoshi...
GECCO
2006
Springer
195views Optimization» more  GECCO 2006»
15 years 10 months ago
Studying XCS/BOA learning in Boolean functions: structure encoding and random Boolean functions
Recently, studies with the XCS classifier system on Boolean functions have shown that in certain types of functions simple crossover operators can lead to disruption and, conseque...
Martin V. Butz, Martin Pelikan
CSCLP
2008
Springer
15 years 8 months ago
IDB-ADOPT: A Depth-First Search DCOP Algorithm
Abstract. Many agent coordination problems can be modeled as distributed constraint optimization problems (DCOPs). ADOPT is an asynchronous and distributed search algorithm that is...
William Yeoh, Ariel Felner, Sven Koenig