Sciweavers

5510 search results - page 419 / 1102
» Mathematics
Sort
View
ENTCS
2007
89views more  ENTCS 2007»
15 years 7 months ago
Hierarchical Nominal Terms and Their Theory of Rewriting
Nominal rewriting introduced a novel method of specifying rewriting on syntax-with-binding. We extend this treatment of rewriting with hierarchy of variables representing increasi...
Murdoch Gabbay
JSAC
2006
180views more  JSAC 2006»
15 years 7 months ago
A Tutorial on Decomposition Methods for Network Utility Maximization
A systematic understanding of the decomposability structures in network utility maximization is key to both resource allocation and functionality allocation. It helps us obtain the...
Daniel Pérez Palomar, Mung Chiang
JSYML
2006
62views more  JSYML 2006»
15 years 7 months ago
Uniform almost everywhere domination
Abstract. We explore the interaction between Lebesgue measure and dominating functions. We show, via both a priority construction and a forcing construction, that there is a functi...
Peter Cholak, Noam Greenberg, Joseph S. Miller
MLQ
2006
84views more  MLQ 2006»
15 years 7 months ago
A note on Bar Induction in Constructive Set Theory
Bar Induction occupies a central place in Brouwerian mathematics. This note is concerned with the strength of Bar Induction on the basis of Constructive ZermeloFraenkel Set Theory...
Michael Rathjen
MP
2006
101views more  MP 2006»
15 years 7 months ago
Computational complexity of stochastic programming problems
Stochastic programming is the subfield of mathematical programming that considers optimization in the presence of uncertainty. During the last four decades a vast amount of litera...
Martin E. Dyer, Leen Stougie