• 検索結果がありません。

An Optimal File Transfer on an Undirected Path Network with 2-level Arc Cost

N/A
N/A
Protected

Academic year: 2021

シェア "An Optimal File Transfer on an Undirected Path Network with 2-level Arc Cost"

Copied!
9
0
0

読み込み中.... (全文を見る)

全文

(1)

Title

An Optimal File Transfer on an Undirected Path Network with 2-

level Arc Cost( 本文(Fulltext) )

Author(s)

金子, 美博

Citation

[情報処理学会研究報告. AL, アルゴリズム研究会報告]

vol.[2003] no.[110] p.[1]-[8]

Issue Date

2003-11-07

Rights

Information Processing Society of Japan (社団法人情報処理学

会)

Version

出版社版 (publisher version) postprint

URL

http://hdl.handle.net/20.500.12099/25489

(2)

Information Processing Society of Japan

(3)

Information Processing Society of Japan

(4)

Information Processing Society of Japan

(5)

Information Processing Society of Japan

(6)

Information Processing Society of Japan

(7)

Information Processing Society of Japan

(8)

Information Processing Society of Japan

(9)

Information Processing Society of Japan

参照

関連したドキュメント

We generalized Definition 5 of close-to-convex univalent functions so that the new class CC) includes p-valent functions.. close-to-convex) and hence any theorem about

Zaslavski, Generic existence of solutions of minimization problems with an increas- ing cost function, to appear in Nonlinear

In [10, 12], it was established the generic existence of solutions of problem (1.2) for certain classes of increasing lower semicontinuous functions f.. Note that the

We have seen that Falk-Soland’s rectangular branch-and-bound algorithm can serve as a useful procedure in solving linear programs with an addi- tional separable reverse

Theorem 1.2 For each connected graph = (f, α) defined in Construction 6.1, with automorphism group A = Aut () given in Proposition 8.1, G is an index two subgroup of A, is

In this paper, by employing a functional inequality introduced in [5], which is an abstract generalization of the classical Jessen’s inequality [10], we further establish the

As a special case of that general result, we obtain new fractional inequalities involving fractional integrals and derivatives of Riemann-Liouville type1. Consequently, we get

One can compute that the last four hypergraphs each have exactly two vertices contained in exactly one large empty cluster; in each case, these are the two lowest vertices of the