Sciweavers

1632 search results - page 66 / 327
» On special numberings of hypergraphs
Sort
View
COMBINATORICS
2000
90views more  COMBINATORICS 2000»
15 years 6 months ago
Determinantal Expression and Recursion for Jack Polynomials
We describe matrices whose determinants are the Jack polynomials expanded in terms of the monomial basis. The top row of such a matrix is a list of monomial functions, the entries...
Luc Lapointe, Alain Lascoux, Jennifer Morse
COMCOM
1999
124views more  COMCOM 1999»
15 years 6 months ago
Minimizing the Cost of Fault Location when Testing from a Finite State Machine
If a test does not produce the expected output, the incorrect output may have been caused by an earlier state transfer failure. Ghedamsi and von Bochmann [1992] and Ghedamsi et al...
Robert M. Hierons
JMLR
2002
100views more  JMLR 2002»
15 years 6 months ago
On the Convergence of Optimistic Policy Iteration
We consider a finite-state Markov decision problem and establish the convergence of a special case of optimistic policy iteration that involves Monte Carlo estimation of Q-values,...
John N. Tsitsiklis
SIGCSE
2002
ACM
178views Education» more  SIGCSE 2002»
15 years 6 months ago
Making compiler design relevant for students who will (most likely) never design a compiler
Compiler Design courses are a common component of most modern Computer Science undergraduate curricula. At the same time, however, compiler design has become a highly specialized ...
Saumya K. Debray
COLOGNETWENTE
2010
15 years 4 months ago
Complexity of O'Hara's Algorithm
In this paper we analyze O’Hara’s partition bijection. We present three type of results. First, we show that O’Hara’s bijection can be viewed geometrically as a certain sci...
Matjaz Konvalinka, Igor Pak