找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Design and Analysis of Algorithms; First Mediterranean Guy Even,Dror Rawitz Conference proceedings 2012 Springer-Verlag Berlin Heidelberg

[复制链接]
查看: 24479|回复: 57
发表于 2025-3-21 18:03:48 | 显示全部楼层 |阅读模式
书目名称Design and Analysis of Algorithms
副标题First Mediterranean
编辑Guy Even,Dror Rawitz
视频video
概述Fast track conference proceedings.Unique visibility.State of the art research
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Design and Analysis of Algorithms; First Mediterranean  Guy Even,Dror Rawitz Conference proceedings 2012 Springer-Verlag Berlin Heidelberg
描述This book constitutes the refereed proceedings of the First Mediterranean Conference on Algorithms, MedAlg 2012, held in Kibbutz Ein Gedi, Israel, in December 2012. .The 18 papers presented were carefully reviewed and selected from 44 submissions. The conference papers focus on the design, engineering, theoretical and experimental performance analysis of algorithms for problems arising in different areas of computation. Topics covered include: communications networks, combinatorial optimization and approximation, parallel and distributed computing, computer systems and architecture, economics, game theory, social networks and the World Wide Web.
出版日期Conference proceedings 2012
关键词dynamic networks; graphs; periodic patterns; routing; scheduling; algorithm analysis and problem complexi
版次1
doihttps://doi.org/10.1007/978-3-642-34862-4
isbn_softcover978-3-642-34861-7
isbn_ebook978-3-642-34862-4Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 2012
The information of publication is updating

书目名称Design and Analysis of Algorithms影响因子(影响力)




书目名称Design and Analysis of Algorithms影响因子(影响力)学科排名




书目名称Design and Analysis of Algorithms网络公开度




书目名称Design and Analysis of Algorithms网络公开度学科排名




书目名称Design and Analysis of Algorithms被引频次




书目名称Design and Analysis of Algorithms被引频次学科排名




书目名称Design and Analysis of Algorithms年度引用




书目名称Design and Analysis of Algorithms年度引用学科排名




书目名称Design and Analysis of Algorithms读者反馈




书目名称Design and Analysis of Algorithms读者反馈学科排名




单选投票, 共有 1 人参与投票
 

1票 100.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 22:07:58 | 显示全部楼层
发表于 2025-3-22 00:30:13 | 显示全部楼层
发表于 2025-3-22 04:56:56 | 显示全部楼层
发表于 2025-3-22 10:17:03 | 显示全部楼层
Catherine Allan,Allan Curtis,Bruce ShindlerWe show that SETF, the idealized version of the uniprocessor scheduling algorithm used by Unix, is scalable for the objective of fractional flow on a homogeneous multiprocessor. We also give a potential function analysis for the objective of weighted fractional flow on a uniprocessor.
发表于 2025-3-22 14:19:12 | 显示全部楼层
Shortest-Elapsed-Time-First on a Multiprocessor,We show that SETF, the idealized version of the uniprocessor scheduling algorithm used by Unix, is scalable for the objective of fractional flow on a homogeneous multiprocessor. We also give a potential function analysis for the objective of weighted fractional flow on a uniprocessor.
发表于 2025-3-22 17:34:44 | 显示全部楼层
Mart-Jan Schelhaas,Marian Lajos Mayrn, i.e., the longest subsequence . of ., for which there exists a number . such that the absolute difference between any two consecutive numbers in the subsequence is at least . and at most .(1 + .)..The best known algorithm for this problem has .(..) time complexity. This bound is too high for larg
发表于 2025-3-23 00:07:38 | 显示全部楼层
Arnór Snorrason,Bjarki Kjartanssonding, are not applicable. This has recently been demonstrated for Strassen’s and Strassen-like fast square matrix multiplication algorithms. Here we extend the expansion analysis approach to fast algorithms for rectangular matrix multiplication, obtaining a new class of communication cost lower boun
发表于 2025-3-23 03:47:54 | 显示全部楼层
Arnór Snorrason,Bjarki Kjartanssone . is the static power, and . > 1 is some constant. We assume that a link may be shutdown if not in use. In response to the arrival of client . at vertex .. a routing path (the virtual circuit) .. connecting a fixed source . to sink .. must be established. The objective is to minimize the aggregate
发表于 2025-3-23 07:33:25 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-2 11:41
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表