240 search results - page 6 / 48 » The Tree Inclusion Problem: In Optimal Space and Faster |
TEC
2002
13 years 6 months ago
2002
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
GECCO
2004
Springer
14 years 14 days ago
2004
Springer
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
ICIP
2008
IEEE
14 years 1 months ago
2008
IEEE
In this paper, we propose a new fast semi-supervised image segmentation method based on augmented tree partitioning. Unlike many existing methods that use a graph structure to mod...
IJCAI
2003
13 years 8 months ago
2003
Given a set of numbers, and a set of bins of fixed capacity, the NP-complete problem of bin packing is to find the minimum number of bins needed to contain the numbers, such that ...
CP
2011
Springer
12 years 7 months ago
2011
Springer
A Distributed Constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Since it is NP-hard, consi...