Sciweavers

31 search results - page 6 / 7
» Interpreting Freeform Equation Solving
Sort
View
FOSSACS
2003
Springer
13 years 10 months ago
A Game Semantics for Generic Polymorphism
Genericity is the idea that the same program can work at many different data types. Longo, Milstead and Soloviev proposed to capture the inability of generic programs to probe th...
Samson Abramsky, Radha Jagadeesan
SIAMSC
2010
136views more  SIAMSC 2010»
13 years 6 days ago
A Krylov Method for the Delay Eigenvalue Problem
Abstract. The Arnoldi method is currently a very popular algorithm to solve large-scale eigenvalue problems. The main goal of this paper is to generalize the Arnoldi method to the ...
Elias Jarlebring, Karl Meerbergen, Wim Michiels
ICML
1999
IEEE
14 years 6 months ago
Least-Squares Temporal Difference Learning
Excerpted from: Boyan, Justin. Learning Evaluation Functions for Global Optimization. Ph.D. thesis, Carnegie Mellon University, August 1998. (Available as Technical Report CMU-CS-...
Justin A. Boyan
SAS
1992
Springer
171views Formal Methods» more  SAS 1992»
13 years 9 months ago
Static Analysis of CLP Programs over Numeric Domains
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
Roberto Bagnara, Roberto Giacobazzi, Giorgio Levi
LICS
1991
IEEE
13 years 9 months ago
The Fixed Point Property in Synthetic Domain Theory
We present an elementary axiomatisation of synthetic domain theory and show that it is sufficient to deduce the fixed point property and solve domain equations. Models of these a...
Paul Taylor 0002