用户名  找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Experimental Algorithms; 12th International S Vincenzo Bonifaci,Camil Demetrescu,Alberto Marchet Conference proceedings 2013 Springer-Verla

[复制链接]
查看: 7029|回复: 59
发表于 2025-3-21 16:24:29 | 显示全部楼层 |阅读模式
书目名称Experimental Algorithms
副标题12th International S
编辑Vincenzo Bonifaci,Camil Demetrescu,Alberto Marchet
视频video
概述Fast track conference proceedings.Unique visibility.State of the art research
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Experimental Algorithms; 12th International S Vincenzo Bonifaci,Camil Demetrescu,Alberto Marchet Conference proceedings 2013 Springer-Verla
描述This book constitutes the refereed proceedings of the 12th International Symposium on Experimental Algorithms, SEA 2013, held in Rome, Italy, in June 2013. .The 32 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 73 submissions. The papers are organized in topical sections on transportation networks and graph algorithms, combinatorics and enumeration, data structures and compression, network partitioning and bioinformatics, mathematical programming, geometry and optimization, and scheduling and local search.
出版日期Conference proceedings 2013
关键词discrete mathematics; hypergraphs; integer programming; parsing; transit routing; algorithm analysis and
版次1
doihttps://doi.org/10.1007/978-3-642-38527-8
isbn_softcover978-3-642-38526-1
isbn_ebook978-3-642-38527-8Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 2013
The information of publication is updating

书目名称Experimental Algorithms影响因子(影响力)




书目名称Experimental Algorithms影响因子(影响力)学科排名




书目名称Experimental Algorithms网络公开度




书目名称Experimental Algorithms网络公开度学科排名




书目名称Experimental Algorithms被引频次




书目名称Experimental Algorithms被引频次学科排名




书目名称Experimental Algorithms年度引用




书目名称Experimental Algorithms年度引用学科排名




书目名称Experimental Algorithms读者反馈




书目名称Experimental Algorithms读者反馈学科排名




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

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 22:32:45 | 显示全部楼层
发表于 2025-3-22 03:54:56 | 显示全部楼层
发表于 2025-3-22 04:40:35 | 显示全部楼层
Conference proceedings 2013ganized in topical sections on transportation networks and graph algorithms, combinatorics and enumeration, data structures and compression, network partitioning and bioinformatics, mathematical programming, geometry and optimization, and scheduling and local search.
发表于 2025-3-22 10:46:04 | 显示全部楼层
Gene Interactions in Developmentin its entirety minimizes the user’s expected arrival time at the destination. Our experiments on the dense metropolitan network of London show that CSA computes MEAT queries, our most complex scenario, in 272 ms on average.
发表于 2025-3-22 16:24:11 | 显示全部楼层
发表于 2025-3-22 19:21:13 | 显示全部楼层
发表于 2025-3-22 21:21:03 | 显示全部楼层
Ismail Moghul,Anurag Priyam,Yannick Wurmperties to determine how well a network fits this model. We then evaluate three (partially adapted) clustering algorithms from the literature on random networks that fit our model, based on the scores and comparison to the ground truth. This allows to pinpoint the types of networks for which the different algorithms perform well.
发表于 2025-3-23 04:51:11 | 显示全部楼层
发表于 2025-3-23 06:30:01 | 显示全部楼层
Space-Efficient, High-Performance Rank and Select Structures on Uncompressed Bit Sequences, our rank & select structures impose space overhead as low as the most space-efficient, but slower, prior designs—only 3.2% and 0.39% extra space respectively—while offering performance competitive with the highest-performance prior designs.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-6 11:14
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表