Sciweavers

5096 search results - page 788 / 1020
» Associations as a Language Construct
Sort
View
ENTCS
2006
103views more  ENTCS 2006»
15 years 6 months ago
Supporting SAT based BMC on Finite Path Models
The standard translation of a Bounded Model Checking (BMC) instance into a satisfiability problem, (a.k.a SAT), might produce misleading results in the case when the model under v...
Daniel Geist, Mark Ginzburg, Yoad Lustig, Ishai Ra...
ENTCS
2006
135views more  ENTCS 2006»
15 years 6 months ago
Initializing Mutually Referential Abstract Objects: The Value Recursion Challenge
zing Mutually Referential Abstract Objects: The Value Recursion Challenge Don Syme 1 Microsoft Research, Cambridge, U.K. Mutual dependencies between objects arise frequently in pr...
Don Syme
JASIS
2006
120views more  JASIS 2006»
15 years 6 months ago
Building a reusable test collection for question answering
In contrast to traditional information retrieval systems, which return ranked lists of documents that users must manually browse through, a question answering system attempts to d...
Jimmy J. Lin, Boris Katz
JISE
2006
85views more  JISE 2006»
15 years 6 months ago
A Programming Methodology for Designing Block Recursive Algorithms
In this paper, we use the tensor product notation as the framework of a programming methodology for designing block recursive algorithms. We first express a computational problem ...
Min-Hsuan Fan, Chua-Huang Huang, Yeh-Ching Chung, ...
ML
2008
ACM
135views Machine Learning» more  ML 2008»
15 years 6 months ago
Compiling pattern matching to good decision trees
We address the issue of compiling ML pattern matching to compact and efficient decisions trees. Traditionally, compilation to decision trees is optimized by (1) implementing decis...
Luc Maranget