We introduce a new approach to planning in STRIPS-like domains based on constructing and analyzing a compact structure we call a Planning Graph. We describe a new planner, Graphplan, that uses thisâ€¦ (More)

22nd Annual Symposium on Foundations of Computerâ€¦

1981

A function f is realizable in bounded depth and g(n) size .if there is a sequence of circuits 0 1 , C2 ,.Â·â€¢â€¢ mane np of !\,V, and not ~ates in which the i th circuit COIJlputes f on inputs of size i,â€¦ (More)

Many different types of inter-process communication have been examined from a complexity point of view [SP, Y]. We study a new model, in which a collection of processes
â€¦ (More)

We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF formulas with membershipâ€¦ (More)

Modern cryptography has had considerable impact on the development of com putational learning theory Virtually every intractability result in Valiant s model which is representation independent inâ€¦ (More)

21st Annual Symposium on Foundations of Computerâ€¦

1980

A permutation group on n letters may always be represented by a small set of generators, even though its size may be exponential in n. We show that it is practical to use such a representation sinceâ€¦ (More)

A super-polynomial lower bound is given for the size of circuits of fixed depth computing the parity function. Introducing the notion of polynomial-size, constant-depth reduction, similar results areâ€¦ (More)

A bstract. A new approach for designing and training neural networks is developed using a distr ibuted genet ic algorithm. A search for the optimal architecture and weights of a neural networkâ€¦ (More)