1816 search results - page 8 / 364 » A New Approach for Solving the Maximum Clique Problem |
SWAT
2004
Springer
15 years 2 months ago
2004
Springer
In this paper, we consider the problems of generating all maximal (bipartite) cliques in a given (bipartite) graph G = (V, E) with n vertices and m edges. We propose two algorithms...
SAT
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...
IDA
2005
Springer
15 years 3 months ago
2005
Springer
In this paper we introduce a simple ant based algorithm for solving a copper mine planning problem. In the last 10 years this realworld problem has been tackled using linear intege...
ECAI
2008
Springer
14 years 11 months ago
2008
Springer
The problem of expressing and solving satisfiability problems (SAT) with qualitative preferences is central in many areas of Computer Science and Artificial Intelligence. In previo...
IFIP
1994
Springer
15 years 1 months ago
1994
Springer
Object-oriented system development is wideley recognized as improving productivity and reducing system maintenance costs. However, existing approaches have not su ciently addresse...