922 search results - page 30 / 185 » On a Generalization of the Stone-Weierstrass Theorem |
109
click to vote
CADE
2007
Springer
16 years 2 months ago
2007
Springer
Much research concerning Satisfiability Modulo Theories is devoted to the design of efficient SMT-solvers that integrate a SATsolver with T -satisfiability procedures. The rewrite-...
133
click to vote
ICFP
2003
ACM
16 years 1 months ago
2003
ACM
I describe the mechanisation in HOL of some basic -calculus theory, using the axioms proposed by Gordon and Melham [4]. Using these as a foundation, I mechanised the proofs from C...
97
Voted
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
A number of recent studies introduced meta-evolutionary strategies and successfully used them for solving problems in genetic programming. While individual results indicate possib...
119
click to vote
MFCS
2005
Springer
15 years 7 months ago
2005
Springer
Due to extensive research on tree-width for undirected graphs and due to its many applications in various fields it has been a natural desire for many years to generalize the idea...
CORR
2006
Springer
15 years 1 months ago
2006
Springer
We consider the general relay channel. For this setup, the best achievability result was derived by Cover and ElGamal, in theorem 6 of their paper from 1979. In this work we apply...