12265 search results - page 364 / 2453 » Knuth-Morris-Pratt Algorithm: An Analysis |
201
click to vote
COCO
1995
Springer
15 years 10 months ago
1995
Springer
For the worst-case complexity measure, if P = NP, then P = OptP, i.e., all NP optimization problems are polynomial-time solvable. On the other hand, it is not clear whether a simi...
169
click to vote
DAC
2009
ACM
15 years 10 months ago
2009
ACM
In this paper, we propose a novel simulation algorithm for large scale structured power grid networks. The new method formulates the traditional linear system as a special two-dim...
190
click to vote
AUTOMATICA
2008
15 years 6 months ago
2008
This paper proposes an algorithm for the characterization of reachable sets of states for continuous-time piecewise affine systems. Given a model of the system and a bounded set o...
184
click to vote
MOC
2002
15 years 6 months ago
2002
In this paper two classes of iterative methods for saddle point problems are considered: inexact Uzawa algorithms and a class of methods with symmetric preconditioners. In both cas...
135
click to vote
IEEECIT
2010
IEEE
15 years 5 months ago
2010
IEEE
—This paper analyses remainder signs determinant issue in the computer fixed-point division operation. Together with the manual binary number division, the true code addition and...