1379 search results - page 148 / 276 » The Complexity of the Annihilating Polynomial |
186
click to vote
HPCC
2007
Springer
16 years 18 days ago
2007
Springer
Abstract. Automatic execution time prediction of the Grid applications plays a critical role in making the pervasive Grid more reliable and predictable. However, automatic executio...
170
click to vote
ICALP
2007
Springer
16 years 18 days ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
154
click to vote
TACAS
2007
Springer
16 years 17 days ago
2007
Springer
This paper considers algorithms and complexity results for the generation of counterexamples in model checking of probabilistic until-formulae in discrete-time Markov chains (DTMCs...
169
click to vote
ICRA
2006
IEEE
16 years 15 days ago
2006
IEEE
— In this paper we address the problem of generating input plans to steer complex dynamical systems in an obstaclefree environment. Plans considered admit a finite description l...
167
click to vote
ANSS
2005
IEEE
16 years 2 days ago
2005
IEEE
When performed on a classical computer, the simulation of quantum circuits is usually an exponential job. The methodology based on Hardware Description Languages is able to isolat...