Sciweavers

738 search results - page 54 / 148
» Prime Implicant Computation Using Satisfiability Algorithms
Sort
View
TEC
2008
139views more  TEC 2008»
14 years 9 months ago
Genetic Programming Approaches for Solving Elliptic Partial Differential Equations
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...
Andras Sobester, Prasanth B. Nair, Andy J. Keane
INFOCOM
2010
IEEE
14 years 7 months ago
An Axiomatic Theory of Fairness in Network Resource Allocation
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...
Tian Lan, David Kao, Mung Chiang, Ashutosh Sabharw...
PAIRING
2007
Springer
140views Cryptology» more  PAIRING 2007»
15 years 3 months ago
The Tate Pairing Via Elliptic Nets
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...
Katherine E. Stange
DAC
2003
ACM
15 years 10 months ago
Learning from BDDs in SAT-based bounded model checking
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...
Aarti Gupta, Malay K. Ganai, Chao Wang, Zijiang Ya...
CVPR
2007
IEEE
15 years 11 months ago
Moving Forward in Structure From Motion
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...
Andrea Vedaldi, Gregorio Guidi, Stefano Soatto