Sciweavers

2652 search results - page 92 / 531
» Privacy-preserving linear programming
Sort
View
FLOPS
2010
Springer
14 years 10 months ago
Proving Injectivity of Functions via Program Inversion in Term Rewriting
Injectivity is one of the important properties for functions while it is undecidable in general and decidable for linear treeless functions. In this paper, we show new sufficient c...
Naoki Nishida, Masahiko Sakai
ENTCS
2010
208views more  ENTCS 2010»
14 years 9 months ago
Accelerated Invariant Generation for C Programs with Aspic and C2fsm
In this paper, we present Aspic, an automatic polyhedral invariant generation tool for flowcharts programs. Aspic implements an improved Linear Relation Analysis on numeric counte...
Paul Feautrier, Laure Gonnord
AAAI
2011
13 years 12 months ago
Commitment to Correlated Strategies
The standard approach to computing an optimal mixed strategy to commit to is based on solving a set of linear programs, one for each of the follower’s pure strategies. We show t...
Vincent Conitzer, Dmytro Korzhyk
ICALP
2001
Springer
15 years 4 months ago
On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities
We consider the problem of enumerating all minimal integer solutions of a monotone system of linear inequalities. We first show that for any monotone system of r linear inequaliti...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...
CORR
2010
Springer
153views Education» more  CORR 2010»
14 years 12 months ago
The Automatic Synthesis of Linear Ranking Functions: The Complete Unabridged Version
The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking ...
Roberto Bagnara, Fred Mesnard, Andrea Pescetti, En...