1226 search results - page 117 / 246 » Proofs, Programs and Abstract Complexity |
126
Voted
CAV
2010
Springer
15 years 6 months ago
2010
Springer
We consider the class of finite-state programs executed by an unbounded number of replicated threads communicating via shared variables. The thread-state reachability problem for t...
132
click to vote
EUROPAR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Complex software systems use many shared libraries frequently composed of large off-the-shelf components. Only a limited number of functions are used from these shared li...
147
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
125
click to vote
JACM
2006
15 years 3 months ago
2006
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
119
click to vote
TACAS
2009
Springer
15 years 10 months ago
2009
Springer
We discuss the problem of path feasibility for programs manipulating strings using a collection of standard string library functions. We prove results on the complexity of this pro...