找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

Titlebook: WALCOM: Algorithms and Computation; 12th International C M. Sohel Rahman,Wing-Kin Sung,Ryuhei Uehara Conference proceedings 2018 Springer I

[復(fù)制鏈接]
樓主: 徽章
41#
發(fā)表于 2025-3-28 15:17:12 | 只看該作者
42#
發(fā)表于 2025-3-28 20:15:06 | 只看該作者
Random Popular Matchings with Incomplete Preference Lists,e problem of matching every person with a unique?item. A?matching . is . if for any other matching ., the number of people who prefer . to . is not less than the number of those who prefer . to .. For given . and ., consider the probability of existence of a popular matching when each person’s prefe
43#
發(fā)表于 2025-3-28 23:41:10 | 只看該作者
Scheduling Batch Processing in Flexible Flowshop with Job Dependent Buffer Requirements: Lagrangian parallel identical machines and the second stage consists of a single machine processing jobs in the predefined batches. Motivated by applications where unloading and loading occur when the means of transportation are changed, the processing of the jobs, constituting a batch, can commence only if t
44#
發(fā)表于 2025-3-29 05:16:30 | 只看該作者
45#
發(fā)表于 2025-3-29 08:11:03 | 只看該作者
46#
發(fā)表于 2025-3-29 13:43:19 | 只看該作者
A Note on Online Colouring Problems in Overlap Graphs and Their Complements,e intervals presented in non-decreasing order of the left endpoints. We consider the usual colouring problem as well as .-bounded colouring and the same problems in the complement graph. We also consider the case where at most . intervals of the same colour can include the same element. For these ve
47#
發(fā)表于 2025-3-29 16:14:50 | 只看該作者
Fault-Tolerant Complete Visibility for Asynchronous Robots with Lights Under One-Axis Agreement,s under the . model. We study the fundamental . problem of repositioning . robots on a plane so that each robot is visible to all others. We assume . under which a robot cannot see another robot if a third robot is positioned between them on the straight line connecting them. We are interested in .
48#
發(fā)表于 2025-3-29 20:32:25 | 只看該作者
Online Facility Assignment,n an online manner. We must assign customer . to facility . before the next customer . arrives. The cost of this assignment is the distance between . and .. The total number of customers is at most |.|. and each customer must be assigned to a facility. The objective is to minimize the sum of all ass
49#
發(fā)表于 2025-3-30 01:29:43 | 只看該作者
50#
發(fā)表于 2025-3-30 07:45:55 | 只看該作者
 關(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 10:56
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
长沙县| 绥中县| 商河县| 邓州市| 江门市| 天台县| 阳原县| 茶陵县| 定安县| 芷江| 新竹市| 阿拉善右旗| 静安区| 永顺县| 探索| 文化| 云安县| 田林县| 南岸区| 西丰县| 沂水县| 浙江省| 北票市| 青浦区| 深泽县| 家居| 长顺县| 南充市| 宜春市| 巴林右旗| 晴隆县| 衡东县| 宣化县| 汤阴县| 岐山县| 湖口县| 前郭尔| 行唐县| 呼和浩特市| 南康市| 巨野县|