1816 search results - page 4 / 364 » A New Approach for Solving the Maximum Clique Problem |
123
click to vote
SARA
2009
Springer
15 years 8 months ago
2009
Springer
In this paper, we propose a new approach for solving the SAT problem. This approach consists in representing SAT instances thanks to an undirected graph issued from a polynomial t...
70
Voted
FSTTCS
2008
Springer
15 years 3 months ago
2008
Springer
109
Voted
DNA
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. The goal of this research is to improve the programmability of DNA-based computers. Novel clockable microreactors can be connected in various ways to solve combinatorial ...
187
click to vote
CP
2009
Springer
16 years 2 months ago
2009
Springer
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
125
click to vote
ATMOS
2010
15 years 26 days ago
2010
The Team Orienteering Problem is a routing problem on a graph with durations associated to the arcs and profits assigned to visiting the vertices. A fixed number of identical ve...