2398 search results - page 279 / 480 » Constraint Programming and Graph Algorithms |
177
click to vote
DAWAK
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Many real world applications rely on the discovery of maximal biclique subgraphs (complete bipartite subgraphs). However, existing algorithms for enumerating maximal bicl...
176
Voted
CEC
2009
IEEE
16 years 1 months ago
2009
IEEE
— In this paper, the performance assessment of the hybrid Archive-based Micro Genetic Algorithm (AMGA) on a set of bound-constrained synthetic test problems is reported. The hybr...
157
click to vote
INFOVIS
2003
IEEE
15 years 11 months ago
2003
IEEE
In visualising multidimensional data, it is well known that different types of data require different types of algorithms to process them. Data sets might be distinguished accordi...
162
click to vote
SAC
2004
ACM
15 years 11 months ago
2004
ACM
We consider the generalized assignment problem in which the objective is to find a minimum cost assignment of a set of jobs to a set of agents subject to resource constraints. Th...
173
click to vote
CP
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...