738 search results - page 54 / 148 » Prime Implicant Computation Using Satisfiability Algorithms |
112
click to vote
TEC
2008
15 years 1 months ago
2008
In this paper, we propose a technique based on genetic programming (GP) for meshfree solution of elliptic partial differential equations. We employ the least-squares collocation pr...
128
click to vote
INFOCOM
2010
IEEE
14 years 11 months ago
2010
IEEE
We present a set of five axioms for fairness measures in resource allocation. A family of fairness measures satisfying the axioms is constructed. Well-known notions such as -fairne...
125
click to vote
PAIRING
2007
Springer
15 years 7 months ago
2007
Springer
We derive a new algorithm for computing the Tate pairing on an elliptic curve over a finite field. The algorithm uses a generalisation of elliptic divisibility sequences known as...
DAC
2003
ACM
16 years 2 months ago
2003
ACM
Bounded Model Checking (BMC) based on Boolean Satisfiability (SAT) procedures has recently gained popularity as an alternative to BDD-based model checking techniques for finding b...
CVPR
2007
IEEE
16 years 3 months ago
2007
IEEE
It is well-known that forward motion induces a large number of local minima in the instantaneous least-squares reprojection error. This is caused in part by singularities in the e...