Results 1  10
of
2,939,992
PAC Learning with Simple Examples
, 1996
"... We define a new PAC learning model. In this model, examples are drawn according to the universal distribution m(: j f) of SolomomoffLevin, where f is the target concept. The consequence is that the simple examples of the target concept have a high probability to be provided to the learning algorith ..."
Abstract

Cited by 16 (3 self)
 Add to MetaCart
We define a new PAC learning model. In this model, examples are drawn according to the universal distribution m(: j f) of SolomomoffLevin, where f is the target concept. The consequence is that the simple examples of the target concept have a high probability to be provided to the learning
1.1 SIMPLE EXAMPLE
"... Graph theory has found extensive application in chemical kinetics. It is this subject that is the goal of this chapter. Let us take а simple example to illustrate the application of graph theory to derive а steadystate kinetic equation for а complex reaction. It is а typical problem for the kinetic ..."
Abstract
 Add to MetaCart
Graph theory has found extensive application in chemical kinetics. It is this subject that is the goal of this chapter. Let us take а simple example to illustrate the application of graph theory to derive а steadystate kinetic equation for а complex reaction. It is а typical problem
A Simple Example
"... We assume a recent version of R such that install.packages(c("Rcpp","RInside","inline")) gets us current versions of the packages. RProtoBuf need the Protocol Buffer library and headers (which is not currently available on Windows / MinGW). All examples shown should wor ..."
Abstract
 Add to MetaCart
We assume a recent version of R such that install.packages(c("Rcpp","RInside","inline")) gets us current versions of the packages. RProtoBuf need the Protocol Buffer library and headers (which is not currently available on Windows / MinGW). All examples shown should
2 A Simple Example
"... This paper discusses some methods that can be used to calculate classification relativities and reduce the error that would otherwise occur by using oneway analysis Section 2 will discuss the problem of risk classiftcation analysis from a mathematical and stattstical viewpoint and show some of the ..."
Abstract
 Add to MetaCart
This paper discusses some methods that can be used to calculate classification relativities and reduce the error that would otherwise occur by using oneway analysis Section 2 will discuss the problem of risk classiftcation analysis from a mathematical and stattstical viewpoint and show some of the implied solutions from these approaches This exposition revisits the work pioneered in the USA by Bailey, Bailey and Simon and Brown, which are the foundations of American casualty practice in the area of classification ratemaking. We will then revisit another technique based on Generalized Linear Modeling (GLM) in Section 3 and discuss the advantages oftmplementing this technique For those who have a strong background in classification ratemaking and (iL\l. we recommend skipping to Sections 4 and S, where we present an application of thts technique to credit msurance and discuss
“JAAMSIM ” DESCRIBED IN THREE SIMPLE EXAMPLES
"... This paper introduces JaamSim, a free, open source simulation software package that includes a modern graphical user interface, draganddrop model building, and 3D graphics. Three simple examples are used to demonstrate the features of the software. ..."
Abstract
 Add to MetaCart
This paper introduces JaamSim, a free, open source simulation software package that includes a modern graphical user interface, draganddrop model building, and 3D graphics. Three simple examples are used to demonstrate the features of the software.
Traversable wormholes: Some simple examples
, 1989
"... Building on the work of Morris, Thorne, and Yurtsever, some particularly simple examples of traversable wormholes are exhibited. These examples are notable both because the analysis is not limited to spherically symmetric cases, and because it is possible to in some sense minimize the use of exotic ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Building on the work of Morris, Thorne, and Yurtsever, some particularly simple examples of traversable wormholes are exhibited. These examples are notable both because the analysis is not limited to spherically symmetric cases, and because it is possible to in some sense minimize the use of exotic
The StructureMapping Engine: Algorithm and Examples
 Artificial Intelligence
, 1989
"... This paper describes the StructureMapping Engine (SME), a program for studying analogical processing. SME has been built to explore Gentner's Structuremapping theory of analogy, and provides a "tool kit" for constructing matching algorithms consistent with this theory. Its flexibili ..."
Abstract

Cited by 512 (115 self)
 Add to MetaCart
, and demonstrate that most of the steps are polynomial, typically bounded by O (N 2 ). Next we demonstrate some examples of its operation taken from our cognitive simulation studies and work in machine learning. Finally, we compare SME to other analogy programs and discuss several areas for future work. This paper
Learning DFA from Simple Examples
, 1997
"... Efficient learning of DFA is a challenging research problem in grammatical inference. It is known that both exact and approximate (in the PAC sense) identifiability of DFA is hard. Pitt, in his seminal paper posed the following open research problem: "Are DFAPACidentifiable if examples are d ..."
Abstract

Cited by 21 (5 self)
 Add to MetaCart
Efficient learning of DFA is a challenging research problem in grammatical inference. It is known that both exact and approximate (in the PAC sense) identifiability of DFA is hard. Pitt, in his seminal paper posed the following open research problem: "Are DFAPACidentifiable if examples
Results 1  10
of
2,939,992