2434 search results - page 52 / 487 » Algorithmic Randomness of Closed Sets |
232
click to vote
ICLP
2009
Springer
16 years 3 months ago
2009
Springer
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...
117
click to vote
DAC
1995
ACM
15 years 6 months ago
1995
ACM
—DARWIN is a tool that is able to synthesize CMOS opamps, on the basis of a genetic algorithm. A randomly generated initial set of opamps evolves to a set in which the topologies...
127
click to vote
ESA
2009
Springer
15 years 9 months ago
2009
Springer
We consider the problem of representing, in a space-efficient way, a function f : S → Σ such that any function value can be computed in constant time on a RAM. Specifically, ou...
JSCIC
2008
15 years 3 months ago
2008
Abstract This paper proposes and implements a novel hybrid level set method which combines the numerical efficiency of the local level set approach with the temporal stability affo...
171
click to vote
ESANN
2006
15 years 4 months ago
2006
Random Forests were introduced by Breiman for feature (variable) selection and improved predictions for decision tree models. The resulting model is often superior to AdaBoost and ...