Sciweavers

7961 search results - page 250 / 1593
» Input-Output Model Programs
Sort
View
142
Voted
DAGSTUHL
2006
15 years 5 months ago
Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries
Generalizing earlier work characterizing the quantum query complexity of computing a function of an unknown classical "black box" function drawn from some set of such bl...
Howard Barnum
ORL
2007
96views more  ORL 2007»
15 years 3 months ago
A note on scenario reduction for two-stage stochastic programs
We extend earlier work on scenario reduction by relying directly on Fortet–Mourier metrics instead of using upper bounds given in terms of mass transportation problems. The impo...
Holger Heitsch, Werner Römisch
ACMMPC
2000
Springer
249views Mathematics» more  ACMMPC 2000»
15 years 8 months ago
Algebraic Methods for Optimization Problems
Abstract. We argue for the benefits of relations over functions for modelling programs, and even more so for modelling specifications. To support this argument, we present an ext...
Richard S. Bird, Jeremy Gibbons, Shin-Cheng Mu
127
Voted
LICS
1989
IEEE
15 years 8 months ago
Computational Lambda-Calculus and Monads
The λ-calculus is considered an useful mathematical tool in the study of programming languages. However, if one uses βη-conversion to prove equivalence of programs, then a gros...
Eugenio Moggi
ITCC
2005
IEEE
15 years 9 months ago
Formalisation and implementation of Access control models
Access control software must be based on a security policy model. Flaws in them may come from a lack of precision or some incoherences in the policy model or from inconsistencies ...
Mathieu Jaume, Charles Morisset