2584 search results - page 431 / 517 » On the Forward Checking Algorithm |
COCOON
2009
Springer
14 years 3 months ago
2009
Springer
Golumbic et al. [Discrete Applied Mathematics 154(2006) 1465-1477] defined the readability of a monotone Boolean function f to be the minimum integer k such that there exists an ...
ESWS
2009
Springer
14 years 3 months ago
2009
Springer
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. Although several decidable fragments of OASP have been identified, few reasonin...
FMCAD
2009
Springer
14 years 3 months ago
2009
Springer
—Boolean manipulation and existential quantification of numeric variables from linear arithmetic (LA) formulas is at the core of many program analysis and software model checkin...
GECCO
2009
Springer
14 years 3 months ago
2009
Springer
We describe a methodology for evolving Java bytecode, enabling the evolution of extant, unrestricted Java programs, or programs in other languages that compile to Java bytecode. B...
OOPSLA
2009
Springer
14 years 3 months ago
2009
Springer
Today’s shared-memory parallel programming models are complex and error-prone. While many parallel programs are intended to be deterministic, unanticipated thread interleavings ...