120 search results - page 15 / 24 » Covered Clause Elimination |
STACS
2004
Springer
15 years 5 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
16 years 1 days 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 ...
91
Voted
MVA
2007
15 years 1 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...
WSCG
2003
15 years 1 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...
100
click to vote
NIPS
1996
15 years 1 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...