257 search results - page 5 / 52 » A (Somewhat) New Solution to the Variable Binding Problem |
VLSID
2007
IEEE
14 years 7 months ago
2007
IEEE
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
BMCBI
2006
13 years 7 months ago
2006
Background: When accurate models for the divergent evolution of protein sequences are integrated with complementary biological information, such as folded protein structures, anal...
CP
2010
Springer
13 years 5 months ago
2010
Springer
We present a new complete multi-valued SAT solver, based on current state-of-the-art SAT technology. It features watched literal propagation and conflict driven clause learning. W...
POPL
2010
ACM
14 years 4 months ago
2010
ACM
Traditional parser generation technologies are incapable of handling the demands of modern programmers. In this paper, we present the design and theory of a new parsing engine, YA...
EUROPAR
2000
Springer
13 years 10 months ago
2000
Springer
One of the advantages of logic programming is the fact that it offers many sources of implicit parallelism, such as and-parallelism and or-parallelism. Arguably, or-parallel system...