2629 search results - page 321 / 526 » complex 2009 |
136
click to vote
TACAS
2009
Springer
15 years 11 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...
143
click to vote
TACAS
2009
Springer
15 years 11 months ago
2009
Springer
We introduce the All-Termination(T) problem: given a termination solver, T, and a program (a set of functions), find every set of formal arguments whose consideration is sufficie...
132
click to vote
VMCAI
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We introduce Subpolyhedra (SubPoly) a new numerical abstract domain to infer and propagate linear inequalities. SubPoly is as expressive as Polyhedra, but it drops some o...
123
click to vote
WEA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. In this paper we present a novel approach to the graph isomorphism problem. We combine a direct approach, that tries to find a mapping between the two input graphs using...
143
click to vote
CCGRID
2009
IEEE
15 years 11 months ago
2009
IEEE
— We propose a novel approach for sharing cluster resources among competing jobs. The key advantage of our approach over current solutions is that it increases cluster utilizatio...