2474 search results - page 147 / 495 » Solving Problems on Parallel Computers by Cellular Programmi... |
135
click to vote
MFCS
2009
Springer
15 years 11 months ago
2009
Springer
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...
119
click to vote
IPPS
2000
IEEE
15 years 9 months ago
2000
IEEE
In the past few years since Adleman’s pioneering work on solving the HPP(Hamiltonian Path Problem) with a DNA-based computer [1], many algorithms have been designed on solving NP...
162
click to vote
CSR
2006
Springer
15 years 8 months ago
2006
Springer
We propose a new model of restricted branching programs specific to solving GEN problems, which we call incremental branching programs. We show that syntactic incremental branchin...
163
click to vote
AGP
1999
IEEE
15 years 9 months ago
1999
IEEE
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
149
click to vote
LPNMR
2001
Springer
15 years 9 months ago
2001
Springer
Schlipf (Sch95) proved that Stable Logic Programming (SLP) solves all NP decision problems. We extend Schlipf’s result to prove that SLP solves all search problems in the class ...