找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

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

[复制链接]
楼主: Nutraceutical
发表于 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
发表于 2025-3-23 17:47:03 | 显示全部楼层
发表于 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
发表于 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
发表于 2025-3-24 03:02:04 | 显示全部楼层
发表于 2025-3-24 09:59:54 | 显示全部楼层
发表于 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.
发表于 2025-3-24 18:03:05 | 显示全部楼层
发表于 2025-3-24 19:19:54 | 显示全部楼层
发表于 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 ..
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-28 12:34
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表