350 search results - page 3 / 70 » Branching Programs for Tree Evaluation |
ARC
2009
Springer
13 years 11 months ago
2009
Springer
The parallel branching program machine (PBM128) consists of 128 branching program machines (BMs) and a programmable interconnection. To represent logic functions on BMs, we use qua...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...
IEICET
2010
13 years 3 months ago
2010
ASP
2005
Springer
13 years 10 months ago
2005
Springer
Answer Set Programming (ASP) and propositional satisfiability (SAT) are closely related. In some recent work we have shown that, on a wide set of logic programs called “tight”...
EICS
2010
ACM
13 years 10 months ago
2010
ACM
Web applications such as web-based email, spreadsheets and form filling applications have become ubiquitous. However, many of the tasks that users try to accomplish with such web ...