找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Experimental Algorithms; 6th International Wo Camil Demetrescu Conference proceedings 2007 Springer-Verlag Berlin Heidelberg 2007 Simulatio

[复制链接]
查看: 51850|回复: 59
发表于 2025-3-21 16:06:33 | 显示全部楼层 |阅读模式
书目名称Experimental Algorithms
副标题6th International Wo
编辑Camil Demetrescu
视频video
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Experimental Algorithms; 6th International Wo Camil Demetrescu Conference proceedings 2007 Springer-Verlag Berlin Heidelberg 2007 Simulatio
描述.This book constitutes the refereed proceedings of the 6th International Workshop on Experimental and Efficient Algorithms, WEA 2007, held in Rome, Italy, in June 2007...The 30 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 121 submissions. Fostering and disseminating high quality research results focused on the experimental analysis of algorithms the papers are devoted to the design, analysis, implementation, experimental evaluation, and engineering of efficient algorithms. Among the application areas addressed are most fields applying advanced algorithmic techniques, such as combinatorial optimization, approximation, graph theory, discrete mathematics, data mining, simulation, cryptography and security, scheduling, searching, sorting, string matching, coding, networking, etc..
出版日期Conference proceedings 2007
关键词Simulation; algorithm; algorithmic mathematics; algorithmics; algorithms; algorithms analysis; algorithms
版次1
doihttps://doi.org/10.1007/978-3-540-72845-0
isbn_softcover978-3-540-72844-3
isbn_ebook978-3-540-72845-0Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 2007
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 23:22:33 | 显示全部楼层
发表于 2025-3-22 01:53:47 | 显示全部楼层
发表于 2025-3-22 05:44:19 | 显示全部楼层
发表于 2025-3-22 12:49:08 | 显示全部楼层
The Revival of the Minority-Alliance,ts. Our preprocessing and side computation costs are the same as for AESA. We propose several improvements, achieving e.g. .(..) construction cost for some 0 < .< 1, and a variant using even less space.
发表于 2025-3-22 15:27:42 | 显示全部楼层
An Alternative Ranking Problem for Search Enginess of experiments comparing these algorithms on several datasets and contrast them with those obtained using an AUC-maximization algorithm. We also compare training times and performance results for the on-line and batch versions, demonstrating that our on-line algorithm scales to relatively large da
发表于 2025-3-22 20:00:35 | 显示全部楼层
Random Models for Geometric Graphs (Abstract)irectional radio frequency and optical networks, is the ., a generalization of the random geometric graph introduced in [1]. In the setting under consideration, each node has a fixed angle . (0 < . ≤ 2.) defining a sector .. of transmission determined by a random angle between the sector and the hor
发表于 2025-3-22 22:37:29 | 显示全部楼层
发表于 2025-3-23 03:44:34 | 显示全部楼层
发表于 2025-3-23 07:33:25 | 显示全部楼层
Simple Space-Time Trade-Offs for AESAts. Our preprocessing and side computation costs are the same as for AESA. We propose several improvements, achieving e.g. .(..) construction cost for some 0 < .< 1, and a variant using even less space.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-8 20:56
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表