2652 search results - page 179 / 531 » Privacy-preserving linear programming |
131
click to vote
ICALP
1998
Springer
15 years 7 months ago
1998
Springer
The complexity of LTrL, a global linear time temporal logic over traces is investigated. The logic is global because the truth of a formula is evaluated in a global state, also ca...
112
click to vote
ICALP
2009
Springer
15 years 7 months ago
2009
Springer
Intuitively, Braess's paradox states that destroying a part of a network may improve the common latency of selfish flows at Nash equilibrium. Such a paradox is a pervasive phe...
117
click to vote
WSC
2007
15 years 5 months ago
2007
This paper addresses several issues of using the mathematical programming representations of discrete-event dynamic systems in perturbation analysis. In particular, linear program...
127
Voted
ORL
1998
15 years 3 months ago
1998
Crowder et al. (Oper. Res. 31 (1983) 803–834) conjectured that the separation problem for cover inequalities for binary integer programs is polynomially solvable. We show that t...
128
click to vote
ICALP
2010
Springer
15 years 1 months ago
2010
Springer
In this paper, we focus our attention on the fragment of Halpern and Shoham's modal logic of intervals (HS) that features four modal operators corresponding to the relations &...