WS3 toda 最近の更新履歴 ソフトウェアエンジニアリングシンポジウム2012

An easy-to-use procedure is presented for improving the ε-constraint method for computing the efficient frontier of the portfolio selection problem endowed with additional cardinality

In Section 3, we study the determining number of trees, providing a linear time algorithm for computing minimum determining sets.. We also show that there exist trees for which

This means that finding the feasible arrays for distance-regular graphs of valency 4 was reduced to a finite amount of work, but the diameter bounds obtained were not small enough

Many interesting graphs are obtained from combining pairs (or more) of graphs or operating on a single graph in some way. We now discuss a number of operations which are used

In our paper we tried to characterize the automorphism group of all integral circulant graphs based on the idea that for some divisors d | n the classes modulo d permute under

Then it follows immediately from a suitable version of “Hensel’s Lemma” [cf., e.g., the argument of [4], Lemma 2.1] that S may be obtained, as the notation suggests, as the m A

Our method of proof can also be used to recover the rational homotopy of L K(2) S 0 as well as the chromatic splitting conjecture at primes p > 3 [16]; we only need to use the

We study the classical invariant theory of the B´ ezoutiant R(A, B) of a pair of binary forms A, B.. We also describe a ‘generic reduc- tion formula’ which recovers B from R(A, B)