23 search results - page 4 / 5 » Satisfiability of Algebraic Circuits over Sets of Natural Nu... |
CORR
2006
Springer
14 years 9 months ago
2006
Springer
In the maximum constraint satisfaction problem (Max CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to ...
120
click to vote
FOSSACS
2001
Springer
15 years 2 months ago
2001
Springer
Hierarchical Message Sequence Charts are a well-established formalism to specify telecommunication protocols. In this model, numerous undecidability results were obtained recently ...
SIGSOFT
1998
ACM
15 years 1 months ago
1998
ACM
This paper reports on an empirical evaluation of the fault-detecting ability of two white-box software testing techniques: decision coverage (branch testing) and the all-uses data...
82
Voted
KDD
2006
ACM
15 years 10 months ago
2006
ACM
We introduce a novel framework (BLOSOM) for mining (frequent) boolean expressions over binary-valued datasets. We organize the space of boolean expressions into four categories: p...
MPC
2010
Springer
15 years 1 months ago
2010
Springer
cting programs and point-free abstraction [2]. In order to automatically generate the fast running code there was the need to use matrix product as the basic matrix composition ope...