找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: High-Latitude Space Plasma Physics; Bengt Hultqvist,Tor Hagfors Book 1983 Springer Science+Business Media New York 1983 Plasma.earth.plane

[復(fù)制鏈接]
樓主: CRUST
31#
發(fā)表于 2025-3-26 22:26:09 | 只看該作者
Stanley W. H. Cowleyinput is an undirected graph . and ordered pairs (..,..), where .?∈?{1,2,…,.}. The goal is to find an orientation of . that minimizes the sum over every .?∈?{1,2,…,.} of the distance from .. to ....In the . the input is the same, however the goal is to find for every .?∈?{1,2,…,.} a path between ..
32#
發(fā)表于 2025-3-27 03:42:28 | 只看該作者
Charles R. Chappellonsecutively processed items generates cost. A reordering buffer of capacity . items can be used to preprocess the input sequence in order to decrease the number of color changes. The goal is to find a scheduling strategy that, using the reordering buffer, minimizes the number of color changes in th
33#
發(fā)表于 2025-3-27 05:33:01 | 只看該作者
34#
發(fā)表于 2025-3-27 13:25:04 | 只看該作者
Duncan A. Bryantrequests. Our algorithm will batch the requests into . groups where the . group contains requests .. To process the requests of group ., our algorithm will place the . servers at the .-median centers of the first . requests. When a new request of this group arrives, the algorithm will simply assign
35#
發(fā)表于 2025-3-27 16:51:21 | 只看該作者
H. Balsiger of competitive algorithms for dynamic problems, where objects can also depart from the instance. In this work, we give a general framework to obtain so called robust online algorithms for a variety of dynamic problems: these online algorithms achieve an asymptotic competitive ratio of . with migrat
36#
發(fā)表于 2025-3-27 20:37:58 | 只看該作者
T. A. Potemrapoints in the Euclidean space. In order to reduce communication costs, the positions of the servers can be adapted by a limited distance . per round for each server. The costs are measured similar to the classical Page Migration Problem, i.e., answering a request induces costs proportional to the di
37#
發(fā)表于 2025-3-27 22:39:48 | 只看該作者
Donald A. Gurnett set cover. For min-sum set cover, Feige, Lovàsz and Tetali [.] showed that the greedy algorithm has an approximation guarantee of 4, and obtaining a better approximation ratio is NP-hard. For precedence-constrained min-sum set cover, McClintock, Mestre and Wirth [.] proposed an .-approximation algo
38#
發(fā)表于 2025-3-28 03:53:28 | 只看該作者
39#
發(fā)表于 2025-3-28 09:33:11 | 只看該作者
40#
發(fā)表于 2025-3-28 10:48:57 | 只看該作者
The Hot Ion Composition, Energy, and Pitch Angle Characteristics Above the Auroral Zone Ionosphere. The ISEE-1 spacecraft, launched in October, 1977, has recently been providing ion composition data at a few R. in the auroral regions as a result of its gradual increase in orbital inclination (to 55° latitude in June, 1981) (Sharp et al., 1982b). Some ion composition measurements have also been m
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-11 16:46
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
十堰市| 延津县| 怀来县| 台东市| 建水县| 怀仁县| 临桂县| 桂平市| 广河县| 麻阳| 嘉黎县| 吴堡县| 观塘区| 富宁县| 德保县| 阿克| 哈密市| 洛扎县| 项城市| 灯塔市| 乌兰浩特市| 井研县| 巴彦淖尔市| 东光县| 台东县| 鄂伦春自治旗| 沙雅县| 抚顺县| 镇康县| 桐城市| 怀集县| 合作市| 台中市| 万州区| 墨竹工卡县| 彭山县| 谢通门县| 乌拉特后旗| 中山市| 盘锦市| 隆尧县|