Sciweavers

350 search results - page 7 / 70
» Separation of Partition Inequalities
Sort
View
INFORMS
2007
62views more  INFORMS 2007»
13 years 7 months ago
On a Binary-Encoded ILP Coloring Formulation
We further develop the 0/1 ILP formulation of Lee for edge coloring where colors are encoded in binary. With respect to that formulation, our main contributions are: (i) an effici...
Jon Lee, François Margot
CIE
2007
Springer
14 years 2 months ago
Nash Stability in Additively Separable Hedonic Games Is NP-Hard
Ballester has shown that the problem of deciding whether a Nash stable partition exists in a hedonic game with arbitrary preferences is NP-complete. In this paper we will prove tha...
Martin Olsen
USS
2004
13 years 9 months ago
Privtrans: Automatically Partitioning Programs for Privilege Separation
Privilege separation partitions a single program into two parts: a privileged program called the monitor and an unprivileged program called the slave. All trust and privileges are...
David Brumley, Dawn Xiaodong Song
CSCW
2004
ACM
14 years 1 months ago
Avoiding interference: how people use spatial separation and partitioning in SDG workspaces
Single Display Groupware (SDG) lets multiple co-located people, each with their own input device, interact simultaneously over a single communal display. While SDG is beneficial, ...
Edward Tse, Jonathan Histon, Stacey D. Scott, Saul...
CAV
2004
Springer
99views Hardware» more  CAV 2004»
14 years 1 months ago
Range Allocation for Separation Logic
Abstract. Separation Logic consists of a Boolean combination of predicates of the form vi ≥ vj +c where c is a constant and vi, vj are variables of some ordered infinite type li...
Muralidhar Talupur, Nishant Sinha, Ofer Strichman,...