Titlebook: Mathematical Foundations of Computer Science 2014; 39th International S Erzsébet Csuhaj-Varjú,Martin Dietzfelbinger,Zoltán Conference proce

只看該作者 · 發(fā)表于 2025-3-23 12:33:06

0302-9743 cal Foundations of Computer Science, MFCS 2014, held in Budapest, Hungary, in August 2014. The 95 revised full papers presented together with 6 invited talks were carefully selected from 270 submissions. The focus of the conference was on following topics: Logic, Semantics, Automata, Theory of Progr

只看該作者 · 發(fā)表于 2025-3-23 14:16:48

The Price of Envy-Freeness in Machine Schedulingation ratio for the minimum makespan problem guaranteed by a polynomial time algorithm for each specific model. Finally, we extend our results to the case of restricted assignments and to the objective of minimizing the sum of the completion times of all the machines.

只看該作者 · 發(fā)表于 2025-3-23 20:21:17

只看該作者 · 發(fā)表于 2025-3-24 00:38:42

只看該作者 · 發(fā)表于 2025-3-24 03:24:26

只看該作者 · 發(fā)表于 2025-3-24 08:46:37

只看該作者 · 發(fā)表于 2025-3-24 13:57:02

只看該作者 · 發(fā)表于 2025-3-24 15:58:02

只看該作者 · 發(fā)表于 2025-3-24 19:13:34

只看該作者 · 發(fā)表于 2025-3-25 01:45:39

Mathematical Foundations of Computer Science 2014978-3-662-44465-8Series ISSN 0302-9743 Series E-ISSN 1611-3349

		自動登錄	找回密碼
密碼			To register

關(guān)于派博傳思			派博傳思旗下網(wǎng)站			友情鏈接
派博傳思介紹	公司地理位置	論文服務(wù)流程	影響因子官網(wǎng)	吾愛論文網(wǎng)	大講堂	北京大學(xué)	Oxford Uni.	Harvard Uni.
發(fā)展歷史沿革	期刊點評	投稿經(jīng)驗總結(jié)	SCIENCEGARD	IMPACTFACTOR	派博系數(shù)	清華大學(xué)	Yale Uni.	Stanford Uni.
\|Archiver\|手機(jī)版\|小黑屋\| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-9 07:37
Copyright © 2001-2015 派博傳思京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved