#### Filter Results:

- Full text PDF available (8)

#### Publication Year

1946

2017

- This year (1)
- Last 5 years (6)
- Last 10 years (8)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

There is a spectrum of methods for learning robot control. At one end there are model-free methods (eg. Q-learning, AHC, bucket brigade), and at the other there are model-based methods, (eg. dynamic programming by value or policy iteration). The advantage of one technique is the weakness of the other. Model-based methods use experience eeectively, but are… (More)

- Carolina Benedetti, Joshua Hallam, John Machacek
- SIAM J. Discrete Math.
- 2016

We consider a Hopf algebra of simplicial complexes and provide a cancellation-free formula for its antipode. We then obtain a family of combinatorial Hopf algebras by defining a family of characters on this Hopf algebra. The characters of these combinatorial Hopf algebras give rise to symmetric functions that encode information about colorings of simplicial… (More)

- Joshua Hallam, Bruce E. Sagan
- J. Comb. Theory, Ser. A
- 2015

Article history: Received 31 October 2014 Available online xxxx

- Olcay Akman, Joshua Hallam
- Front. Neurosci.
- 2010

We implement genetic algorithm based predictive model building as an alternative to the traditional stepwise regression. We then employ the Information Complexity Measure (ICOMP) as a measure of model fitness instead of the commonly used measure of R-square. Furthermore, we propose some modifications to the genetic algorithm to increase the overall… (More)

- Joshua Hallam
- British dental journal
- 1947

- Joshua Hallam
- South African dental journal. Suid Afrikaanse…
- 1946

We introduce a new method for showing that the roots of the characteristic polynomial of a finite lattice are all nonnegative integers. Our method gives two simple conditions under which the characteristic polynomial factors. We will see that Stanley’s Supersolvability Theorem is a corollary of this result. We can also use this method to demonstrate a new… (More)

- Joshua Hallam
- Lancet
- 1947

Let G be a graph with vertex set {1, . . . , n}. A spanning forest F of G is increasing if the sequence of labels on any path starting at the minimum vertex of a tree of F forms an increasing sequence. Hallam and Sagan showed that the generating function ISF(G, t) for increasing spanning forests of G has all nonpositive integral roots. Furthermore they… (More)

- Joshua Hallam
- Journal of the American Dental Association
- 1948