6142 search results - page 833 / 1229 » The Complexity of Partition Functions |
156
click to vote
AMC
2007
15 years 7 months ago
2007
: For computing square roots of a nonsingular matrix A, which are functions of A, two well known fast and stable algorithms, which are based on the Schur decomposition of A, were p...
142
click to vote
AUTOMATICA
2008
15 years 7 months ago
2008
We consider the problem of stabilization of a one-dimensional wave equation that contains instability at its free end and control on the opposite end. In contrast to classical col...
180
click to vote
CAS
2008
15 years 7 months ago
2008
In this paper we first present a novel approach to determine the structural information content (graph entropy) of a network represented by an undirected and connected graph. Such...
189
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
This paper illustrates a technique for specifying the detailed timing, logical operation, and compositional circuit design of digital circuits in terms of ordinary state machines w...
168
click to vote
COR
2008
15 years 7 months ago
2008
This paper presents a tabu search metaheuristic algorithm for the automatic generation of structural software tests. It is a novel work since tabu search is applied to the automat...