1402 search results - page 271 / 281 » Searching Cycle-Disjoint Graphs |
SARA
2009
Springer
14 years 3 months ago
2009
Springer
We study novel approaches for solving of hard combinatorial problems by translation to Boolean Satisfiability (SAT). Our focus is on combinatorial problems that can be represented...
CSL
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
There are many innovative proposals introduced in the literature under the evolutionary computation field, from which estimation of distribution algorithms (EDAs) is one of them....
BIBE
2006
IEEE
14 years 2 months ago
2006
IEEE
Discerning the similarity between two molecules is a challenging problem in drug discovery as well as in molecular biology. The importance of this problem is due to the fact that ...
CGO
2006
IEEE
14 years 2 months ago
2006
IEEE
Most programs are repetitive, where similar behavior can be seen at different execution times. Algorithms have been proposed that automatically group similar portions of a program...