120 search results - page 15 / 24 » Covered Clause Elimination |
STACS
2004
Springer
15 years 2 months ago
2004
Springer
We present two simple algorithms for SAT and prove upper bounds on their running time. Given a Boolean formula F in conjunctive normal form, the first algorithm finds a satisfyin...
CADE
2005
Springer
15 years 10 months ago
2005
Springer
In many theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equality in ...
80
Voted
MVA
2007
14 years 11 months ago
2007
We propose use of an appearance manifold with embedded covariance matrix as a technique for recognizing 3D objects from images that are influenced by geometric and quality-degrade...
69
Voted
WSCG
2003
14 years 11 months ago
2003
An agent-based modeling of virtual ecosystems is presented. A virtual ecosystem develops by plant competition according to biologically inspired rules and tends to reach stability...
NIPS
1996
14 years 11 months ago
1996
In this paper we apply the method of complexity regularization to derive estimation bounds for nonlinear function estimation using a single hidden layer radial basis function netwo...