找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

Titlebook: Combinatorial Optimization and Applications; 16th International C Weili Wu,Jianxiong Guo Conference proceedings 2024 The Editor(s) (if appl

[復(fù)制鏈接]
樓主: Nutraceutical
11#
發(fā)表于 2025-3-23 09:42:36 | 只看該作者
An Energy-Efficient Scheduling Method for?Real-Time Multi-workflow in?Container Cloudmption of cloud service platforms while ensuring the quality of service has become a crucial issue. In this paper, we propose a heuristic energy-saving scheduling algorithm named Real-time Multi-workflow Energy-efficient Scheduling (RMES) with the aim to minimize the total energy consumption in cont
12#
發(fā)表于 2025-3-23 17:47:03 | 只看該作者
13#
發(fā)表于 2025-3-23 20:18:18 | 只看該作者
The MaxIS-Shapley Value in?Perfect Graphshs. The MaxIS problem in perfect graphs can be computed in polynomial time. Many well-studied families of graphs are perfect, for example, bipartite graphs, chordal graphs, forests, etc. The Shapley value is a widely known numerical measure for assessing the contribution of individuals. We study thi
14#
發(fā)表于 2025-3-23 23:30:42 | 只看該作者
Asteroidal Sets and?Dominating Pathsf the third. Asteroidal triple-free (AT-free) graphs are very well-studied, but some of their various superclasses are not. We study two of these superclasses: hereditary dominating pair (HDP) graphs and diametral path graphs. We correct a mistake that has appeared in the literature claiming that th
15#
發(fā)表于 2025-3-24 03:02:04 | 只看該作者
16#
發(fā)表于 2025-3-24 09:59:54 | 只看該作者
17#
發(fā)表于 2025-3-24 12:07:02 | 只看該作者
Jean Dubreuil,Guillaume Bouffardtheorems of constrained set-valued optimization problems are obtained. Some examples are given to illustrate our results. The results obtained in this paper improve and generalize some known results in the literatures.
18#
發(fā)表于 2025-3-24 18:03:05 | 只看該作者
19#
發(fā)表于 2025-3-24 19:19:54 | 只看該作者
20#
發(fā)表于 2025-3-25 02:00:46 | 只看該作者
Rebecca Young,Luke Mather,Elisabeth Oswaldhile in second version we can decide these moments. We show several NP-hardness results as well as a dynamic-programming polynomial time algorithm (for the scenario in which the starting times are given). Then we describe an approximation algorithm with a factor 1/. that has running time exponential in ./., with ..
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-20 13:31
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
敖汉旗| 台北县| 广南县| 蒲城县| 南和县| 岚皋县| 钦州市| 渭南市| 民乐县| 灌阳县| 江阴市| 云和县| 三原县| 孟州市| 安达市| 高尔夫| 高台县| 鄂托克前旗| 集安市| 兴宁市| 清苑县| 鸡泽县| 喀什市| 丰台区| 福州市| 旅游| 松江区| 岐山县| 绥化市| 新乡市| 吉水县| 沙坪坝区| 普宁市| 崇左市| 乐陵市| 呼图壁县| 富顺县| 沙坪坝区| 孝义市| 伊通| 容城县|