找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Experimental Algorithms; 15th International S Andrew V. Goldberg,Alexander S. Kulikov Conference proceedings 2016 Springer International Pu

[复制链接]
查看: 45489|回复: 58
发表于 2025-3-21 17:59:55 | 显示全部楼层 |阅读模式
书目名称Experimental Algorithms
副标题15th International S
编辑Andrew V. Goldberg,Alexander S. Kulikov
视频video
概述Includes supplementary material:
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Experimental Algorithms; 15th International S Andrew V. Goldberg,Alexander S. Kulikov Conference proceedings 2016 Springer International Pu
描述.This book constitutes the refereed proceedings of the 15th International Symposium on Experimental Algorithms, SEA 2016, held in St. Petersburg, Russia, in June 2016..The 25 revised full papers presented were carefully reviewed and selected from 54 submissions. The main theme of the symposium is the role of experimentation and of algorithm engineering techniques in the design and evaluation of algorithms and data structures. SEA covers a wide range of topics in experimental algorithmics, bringing together researchers from algorithm engineering, mathematical programming, and combinatorial optimization communities.
出版日期Conference proceedings 2016
关键词computational complexity; data structures; experimental evaluation; numerical methods; parallel algorith
版次1
doihttps://doi.org/10.1007/978-3-319-38851-9
isbn_softcover978-3-319-38850-2
isbn_ebook978-3-319-38851-9Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer International Publishing Switzerland 2016
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 20:18:12 | 显示全部楼层
发表于 2025-3-22 02:13:22 | 显示全部楼层
Dynamic Time-Dependent Route Planning in Road Networks with User Preferences,ificantly influences the travel time. One can distinguish traffic congestion that can be predicted using historical traffic data, and congestion due to unpredictable events, e. g., accidents. We study the . route planning problem, which takes both live traffic and long-term prediction into account.
发表于 2025-3-22 08:11:25 | 显示全部楼层
发表于 2025-3-22 11:47:30 | 显示全部楼层
发表于 2025-3-22 12:57:06 | 显示全部楼层
A Practical Method for the Minimum Genus of a Graph: Models and Experiments,an integer linear program (ILP) and as a satisfiability problem (SAT). These allow us to develop the first working implementations of general algorithms for the problem, other than exhaustive search. We investigate several different ways to speed-up and strengthen the formulations; our experimental
发表于 2025-3-22 20:51:59 | 显示全部楼层
发表于 2025-3-23 00:15:34 | 显示全部楼层
发表于 2025-3-23 03:05:49 | 显示全部楼层
Accelerating Local Search for the Maximum Independent Set Problem,lization techniques can be used to find exact maximum independent sets in medium-sized sparse graphs, as well as high-quality independent sets in huge sparse graphs that are intractable for exact (exponential-time) algorithms. However, a major drawback of these algorithms is that they require signif
发表于 2025-3-23 08:39:50 | 显示全部楼层
Computing Nonsimple Polygons of Minimum Perimeter,ion: for a given set of vertices in the plane, the problem Minimum Perimeter Polygon (MPP) asks for a (not necessarily simply connected) polygon with shortest possible boundary length. Even though the closely related problem of finding a minimum cycle cover is polynomially solvable by matching techn
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-10 16:12
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表