519 search results - page 72 / 104 » A New Approach to Strongly Polynomial Linear Programming |
120
click to vote
VALUETOOLS
2006
ACM
15 years 7 months ago
2006
ACM
We present a new approximation method called value extrapolation for Markov processes with large or infinite state spaces. The method can be applied for calculating any performan...
TCOM
2008
15 years 1 months ago
2008
This paper proposes a general and systematic code design method to efficiently combine constrained codes with parity-check (PC) codes for optical recording. The proposed constraine...
100
click to vote
CADE
2009
Springer
15 years 8 months ago
2009
Springer
predicate abstraction Shuvendu K. Lahiri and Shaz Qadeer Microsoft Research In this paper, we investigate the asymptotic complexity of various predicate abstraction problems relati...
110
click to vote
PG
2007
IEEE
15 years 7 months ago
2007
IEEE
We describe a new algorithm for the visualisation of implicit algebraic curves, which isolates the singular points, compute the topological degree around these points in order to ...
PLDI
2010
ACM
15 years 10 months ago
2010
ACM
Synthesis of program fragments from specifications can make programs easier to write and easier to reason about. To integrate synthesis into programming languages, synthesis algor...