Sciweavers

189 search results - page 25 / 38
» Solving Distributed Constraint Optimization Problems Using C...
Sort
View
AI
2010
Springer
13 years 9 months ago
Soft arc consistency revisited
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
Martin C. Cooper, Simon de Givry, M. Sanchez, Thom...
GECCO
2006
Springer
179views Optimization» more  GECCO 2006»
14 years 14 days ago
Parisian evolution with honeybees for three-dimensional reconstruction
This paper introduces a novel analogy with the way in which honeybee colonies operate in order to solve the problem of sparse and quasi dense reconstruction. To successfully solve...
Gustavo Olague, Cesar Puente
ICIP
2002
IEEE
14 years 10 months ago
Nonparametric methods for image segmentation using information theory and curve evolution
In this paper, we present a novel information theoretic approach to image segmentation. We cast the segmentation problem as the maximization of the mutual information between the ...
Alan S. Willsky, Anthony J. Yezzi Jr., John W. Fis...
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 9 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
GECCO
2008
Springer
160views Optimization» more  GECCO 2008»
13 years 10 months ago
Self-managing agents for dynamic scheduling in manufacturing
The main purpose of this paper is to propose a Multi-Agent Autonomic and Bio-Inspired based framework with selfmanaging capabilities to solve complex scheduling problems using coo...
Ana Madureira, Filipe Santos, Ivo Pereira