Sciweavers

187 search results - page 2 / 38
» Computing Special Values of Partial Zeta Functions
Sort
View
CORR
2004
Springer
128views Education» more  CORR 2004»
13 years 5 months ago
Specialization of Functional Logic Programs Based on Needed Narrowing
Many functional logic languages are based on narrowing, a unification-based goal-solving mechanism which subsumes the reduction mechanism of functional languages and the resolutio...
María Alpuente, Michael Hanus, Salvador Luc...
JMLR
2010
115views more  JMLR 2010»
13 years 1 days ago
Bayesian structure discovery in Bayesian networks with less space
Current exact algorithms for score-based structure discovery in Bayesian networks on n nodes run in time and space within a polynomial factor of 2n . For practical use, the space ...
Pekka Parviainen, Mikko Koivisto
JAIR
2000
152views more  JAIR 2000»
13 years 5 months ago
Value-Function Approximations for Partially Observable Markov Decision Processes
Partially observable Markov decision processes (POMDPs) provide an elegant mathematical framework for modeling complex decision and planning problems in stochastic domains in whic...
Milos Hauskrecht
ICFP
1999
ACM
13 years 9 months ago
Specialization of Inductively Sequential Functional Logic Programs
Functional logic languages combine the operational principles of the most important declarative programming paradigms, namely functional and logic programming. Inductively sequent...
María Alpuente, Michael Hanus, Salvador Luc...
PEPM
1994
ACM
13 years 9 months ago
Dictionary-Free Overloading by Partial Evaluation
One of the most novel features in the functional programming language Haskell is the system of type classes used to support a combination of overloading and polymorphism. Current ...
Mark P. Jones