4940 search results - page 105 / 988 » On the Complexity of Universal Programs |
156
click to vote
ENTCS
2007
15 years 4 months ago
2007
syntax and explicit substitutions Brigitte Pientka1 School of Computer Science McGill University Montreal, Canada This paper sketches a foundation for programming with higher-orde...
157
click to vote
TLCA
2007
Springer
15 years 10 months ago
2007
Springer
A Kripke Semantics is defined for a higher-order logic programming language with constraints, based on Church’s Theory of Types and a generic constraint formalism. Our syntactic...
137
click to vote
ISPW
2005
IEEE
15 years 10 months ago
2005
IEEE
Medical errors are now recognized as a major cause of untimely deaths or other adverse medical outcomes. To reduce the number of medical errors, the Medical Safety Project at the U...
148
click to vote
SODA
2008
ACM
15 years 6 months ago
2008
ACM
We develop a framework for obtaining Fully Polynomial Time Approximation Schemes (FPTASs) for stochastic univariate dynamic programs with either convex or monotone single-period c...
147
Voted
EOR
2010
15 years 4 months ago
2010
We propose a modified alternate direction method for solving convex quadratically constrained quadratic semidefinite optimization problems. The method is a first-order method, the...