Sciweavers

46 search results - page 4 / 10
» Separability Generalizes Dirac's Theorem
Sort
View
ENTCS
2008
140views more  ENTCS 2008»
13 years 7 months ago
Higher-Order Separation Logic in Isabelle/HOLCF
We formalize higher-order separation logic for a first-order imperative language with procedures and local variables in Isabelle/HOLCF. The assertion language is modeled in such a...
Carsten Varming, Lars Birkedal
JAT
2011
93views more  JAT 2011»
13 years 2 months ago
Approximation theorems for group valued functions
Stone-Weierstrass-type theorems for groups of group-valued functions with discrete range or discrete domain are obtained. We study criteria for a subgroup of the group of continuou...
Jorge Galindo, Manuel Sanchis
IPCO
2007
98views Optimization» more  IPCO 2007»
13 years 9 months ago
On a Generalization of the Master Cyclic Group Polyhedron
We study the Master Equality Polyhedron (MEP) which generalizes the Master Cyclic Group Polyhedron and the Master Knapsack Polyhedron. We present an explicit characterization of t...
Sanjeeb Dash, Ricardo Fukasawa, Oktay Günl&uu...
ENTCS
2006
127views more  ENTCS 2006»
13 years 7 months ago
Process Algebraic Non-product-forms
A generalization of the Reversed Compound Agent Theorem of Markovian process algebra is derived that yields separable, but non-product-form solutions for collections of interactin...
Peter G. Harrison
STOC
2012
ACM
225views Algorithms» more  STOC 2012»
11 years 10 months ago
An algorithmic characterization of multi-dimensional mechanisms
We obtain a characterization of feasible, Bayesian, multi-item multi-bidder mechanisms with independent, additive bidders as distributions over hierarchical mechanisms. Combined w...
Yang Cai, Constantinos Daskalakis, S. Matthew Wein...