4488 search results - page 365 / 898 » Properties of NP-Complete Sets |
166
click to vote
ALIFE
1998
15 years 7 months ago
1998
There have been various attempts to simulate the self-assembly process of lipid aggregates by computers. However, due to the computationally complex nature of the problem, previou...
188
click to vote
JOLLI
2002
15 years 7 months ago
2002
Temporal logic can be used to describe processes: their behaviour is characterized by a set of temporal models axiomatized by a temporal theory. Two types of models are most often ...
209
click to vote
MP
1998
15 years 7 months ago
1998
We consider a generalized semi-infinite optimization problem (GSIP) of the form (GSIP) min{f(x) Ix E M}, where M = {x E N"lhi(x ) = 0, i = 1,...,m, G(x,y) /> 0, y E Y(x)} ...
211
Voted
TIT
1998
15 years 7 months ago
1998
—A length n group code over a group G is a subgroup of Gn under component-wise group operation. Group codes over dihedral groups DM, with 2M elements, that are two-level construc...
180
click to vote
FOCM
2010
15 years 6 months ago
2010
One of the most widely used methods for eigenvalue computation is the QR iteration with Wilkinson’s shift: here the shift s is the eigenvalue of the bottom 2 × 2 principal mino...