检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

89 篇 期刊文献
57 篇 会议
2 篇 学位论文

馆藏范围

148 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

128 篇 工学
- 115 篇 计算机科学与技术...
- 46 篇 软件工程
- 9 篇 电气工程
- 7 篇 控制科学与工程
- 4 篇 信息与通信工程
- 4 篇 交通运输工程
- 2 篇 测绘科学与技术
- 1 篇 机械工程
- 1 篇 仪器科学与技术
- 1 篇 电子科学与技术（可...
- 1 篇 化学工程与技术
- 1 篇 生物工程
59 篇 理学
- 56 篇 数学
- 3 篇 生物学
- 1 篇 化学
- 1 篇 系统科学
18 篇 管理学
- 17 篇 管理科学与工程(可...
- 2 篇 工商管理
- 1 篇 图书情报与档案管...
2 篇 经济学
- 2 篇 应用经济学
1 篇 文学
- 1 篇 新闻传播学

主题

148 篇 algorithm engine...
14 篇 graph algorithms
7 篇 route planning
7 篇 computational ge...
6 篇 shortest paths
5 篇 experimental alg...
5 篇 combinatorial op...
4 篇 approximation al...
4 篇 electric vehicle...
4 篇 speedup techniqu...
4 篇 multimodal route...
4 篇 integer linear p...
3 篇 parallel algorit...
3 篇 time-dependent s...
3 篇 exact algorithms
3 篇 metaheuristics
3 篇 journey planning
3 篇 timetable inform...
3 篇 burrows-wheeler ...
3 篇 text indexing

机构

5 篇 karlsruhe inst t...
3 篇 max planck inst ...
3 篇 tech univ berlin...
3 篇 karlsruhe inst t...
2 篇 univ saarland le...
2 篇 univ melbourne d...
2 篇 univ copenhagen ...
2 篇 simon fraser uni...
2 篇 univ perugia dip...
2 篇 cti patras
2 篇 univ roma la sap...
2 篇 univ nevada sch ...
2 篇 univ pisa largo ...
2 篇 univ piraeus dep...
2 篇 univ patras dept...
2 篇 karlsruhe inst t...
2 篇 technol educ ins...
2 篇 univ utrecht utr...
2 篇 ecole polytech f...
2 篇 max planck inst ...

作者

9 篇 wagner dorothea
8 篇 d'emidio mattia
8 篇 sanders peter
5 篇 baum moritz
5 篇 dibbelt julian
4 篇 luxen dennis
4 篇 delling daniel
3 篇 meyerhenke henni...
3 篇 geisberger rober...
3 篇 hueffner falk
3 篇 vinciguerra gior...
3 篇 skutella martin
3 篇 ferragina paolo
3 篇 meyer ulrich
3 篇 italiano giusepp...
3 篇 niedermeier rolf
3 篇 vetter christian
3 篇 klau gunnar w.
3 篇 chatzigiannakis ...
3 篇 eisenbrand fried...

语言

140 篇 英文
8 篇 其他

检索条件"主题词=Algorithm engineering"

共 148 条记录，以下是71-80 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

An Empirical Comparison of k-Shortest Simple Path algorithms on Multicores 18

An Empirical Comparison of <i>k</i>-Shortest Simple Path Alg...

引用

47th International Conference on Parallel Processing (ICPP)

作者： Ajwani, Deepak Duriakova, Erika Hurley, Neil Meyer, Ulrich Schickedanz, Alexander Nokia Bell Labs Dublin Ireland Univ Coll Dublin Sch Comp Sci Insight Ctr Data Analyt Dublin Ireland Goethe Univ Frankfurt Germany

ISBN: (纸本)9781450365109

We consider the loop less k-shortest path (KSP) problem. Although this problem has been studied in the sequential setting for at least the last two decades, no good parallel implementations are known. In this paper, we provide (i) a first systematic empirical comparison of various KSP algorithms and heuristic optimisations, (ii) carefully engineer various parallel implementations of these sequential algorithms and (iii) perform an extensive study of these parallel implementations on a range of graph classes and multicore architectures to determine the best algorithm and parallelization strategy for different graph classes. We find that even though the worst-case complexity of the best undirected KSP algorithm O (k (m + n log n)) is significantly better than that of the popular and considerably simpler directed KSP algorithm O(kn(m + n log n)), the two algorithms are fairly competitive in terms of their empirical performance on small diameter graphs. Furthermore, we show that a few simple optimisations help to bridge the gap between these KSP algorithms even more. However, on moderate to large diameter graphs, the undirected KSP algorithm is considerably faster than the directed algorithms, both in sequential and parallel settings. In terms of the parallelisation strategy, simply replacing the shortest path subroutine by parallel A-stepping algorithm can provide a good speed-up for many KSP algorithms on random graphs. In contrast, for graphs with skewed degree distribution, a more complex strategy of parallelizing the different deviations and then parallelizing the shortest path computation inside the deviations with the remaining threads, provides a better performance.

关键词： algorithm engineering Parallel k-Shortest Path Parallel Graph algorithms Parallel Single Source Shortest Path

来源：评论

学校读者我要写书评

暂无评论

Tuning algorithms for Jumbled Matching 19

Tuning Algorithms for Jumbled Matching

引用

Prague Stringology Conference (PSC)

作者： Chhabra, Tamanna Ghuman, Sukhpal Singh Tarhio, Jorma Aalto Univ Dept Comp Sci POB 15400 FI-00076 Aalto Finland

ISBN: (纸本)9788001057872

We consider the problem of jumbled matching where the objective is to find all permuted occurrences of a pattern in a text. Besides exact matching we study approximate matching where each occurrence is allowed to contain at most k wrong or superfluous characters. We present online algorithms applying bit-parallelism to both types of jumbled matching. Most of our algorithms are variations of earlier algorithms. We show by practical experiments that our algorithms are competitive with the previous solutions.

关键词： jumbled matching Abelian matching permutation matching approximate string matching comparison of algorithms counting algorithm algorithm engineering

来源：评论

学校读者我要写书评

暂无评论

A Preference-based Activity Scheduling algorithm Using Many-objective Optimization

A Preference-based Activity Scheduling Algorithm Using Many-...

引用

Genetic and Evolutionary Computation Conference (GECCO)

作者： Rothkoetter, Markus Mostaghim, Sanaz Otto von Guericke Univ Magdeburg Saxony Anhalt Germany

ISBN: (纸本)9798400701207

Current business activity scheduling systems are designed to maximise efficiency in terms of business metrics, but rarely take personal preferences into account. The goal of this work is to provide a formalisation and an experimental test of a SCRUM-like personalised scheduling system based on many-objective optimization. We propose a many-objective optimization framework in which the a priori preferences of the human decision makers (DMs) target different regions in the search space, from which the optimization retrieves alternative solutions that allow a posteriori decision making. The implementation of the proposed approach is based on a combination of NSGA-II and two custom operators aimed at proximity-enhanced mutation as well as search-space mapping. Our results show that the proposed method is able to generate diverse schedules. However, the aspiration values (a priori preferences) used in different system configurations notably influence the result characteristics, calling for detailed analysis of the inter-relationships between preferences and the shape of the resulting pareto front. The modelling approach is considered as a successful proof of principle for the intended use case at an abstract level.

关键词： Time-tabling and scheduling Genetic algorithms Mutation operators Multi-objective optimization algorithm engineering

来源：评论

学校读者我要写书评

暂无评论

Fast and Simple Approach for Polygon Schematization 1

引用

12th International Conference on Computational Science and Its Applications (ICCSA)

作者： Cicerone, Serafino Cermignani, Matteo Univ Aquila Dept Elect & Informat Engn I-67100 Laquila Italy

ISBN: (数字)9783642311253

ISBN: (纸本)9783642311246;9783642311253

The schematization of simple polygons into octilinear polygons is a computational problem arising in the context of electronic CAD systems. In particular, it appears when the generation and propagation of electromagnetic noise into real-world multi-layer PCBs has to be detected. In this paper we provide a fast and simple heuristic for solving such a problem. Experimental evaluations over real-world data show the efficiency and the good performance of the proposed approach.

关键词： Computational geometry polygon schematization CAD applications algorithm engineering experimental analysis

来源：评论

学校读者我要写书评

暂无评论

Parallel algorithms Reconsidered 32

Parallel Algorithms Reconsidered

引用

32nd International Symposium on Theoretical Aspects of Computer Science (STACS)

作者： Sanders, Peter Karlsruhe Inst Technol Karlsruhe Germany

ISBN: (纸本)9783939897781

Parallel algorithms have been a subject of intensive algorithmic research in the 1980s. This research almost died out in the mid 1990s. In this paper we argue that it is high time to reconsider this subject since a lot of things have changed. First and foremost, parallel processing has moved from a niche application to something mandatory for any performance critical computer applications. We will also point out that even very fundamental results can still be obtained. We give examples and also formulate some open problems.

关键词： parallel algorithm algorithm engineering communication efficient algorithm polylogarithmic time algorithm parallel machine model

来源：评论

学校读者我要写书评

暂无评论

Nested Monte Carlo Search Expression Discovery for the Automated Design of Fuzzy ART Category Choice Functions 19

Nested Monte Carlo Search Expression Discovery for the Autom...

引用

Genetic and Evolutionary Computation Conference (GECCO)

作者： Illetskova, Marketa Elnabarawy, Islam Brito da Silva, Leonardo Enzo Tauritz, Daniel R. Wunsch, Donald C., II Missouri Univ Sci & Technol Rolla MO 65409 USA Minist Educ Brazil CAPES Fdn Brasilia DF Brazil

ISBN: (纸本)9781450367486

While the performance of many neural network and machine learning schemes has been improved through the automated design of various components of their architectures, the automated improvement of Adaptive Resonance Theory (ART) neural networks remains relatively unexplored. Recent work introduced a genetic programming (GP) approach to improve the performance of the Fuzzy ART neural network employing a hyper-heuristic approach to tailor Fuzzy ART's category choice function to specific problems. The GP method showed promising results. However, GP is not the only tool that can be used for automatic improvement. Among other methods, Nested Monte Carlo Search (NMCS) was recently applied to expression discovery and outperformed traditional evolutionary approaches by finding better solutions in fewer evaluations. This work applies NMCS to the discovery of new Fuzzy ART category choice functions targeted to specific problems with results demonstrating its ability to find better performing Fuzzy ART networks than the GP approach.

关键词： genetic programming neural networks metaheuristics algorithm engineering empirical study

来源：评论

学校读者我要写书评

暂无评论

A randomized algorithm for two servers in cross polytope spaces

引用

5th International Workshop on Approximation and Online algorithms

作者： Bein, Wolfgang Iwama, Kazuo Kawahara, Jun Larmore, Lawrence L. Oravec, James A. Univ Nevada Sch Comp Sci Ctr Adv Study Algorithms Las Vegas NV 89154 USA Kyoto Univ Sch Informat Kyoto 6068501 Japan

ISBN: (纸本)9783540779179

It has been a long-standing open problem to determine the exact randomized competitiveness of the 2-server problem, that is, the minimum competitiveness of any randomized online algorithm for the 2-server problem. For deterministic algorithms the best competitive ratio that can be obtained is 2 and no randomized algorithm is known that improves this ratio for general spaces. For the line, Bartal et al. [2] give a 155/8 competitive algorithm, but their algorithm is specific to the geometry of the line. We consider here the 2-server problem over Cross Polytope Spaces M-2,M-4. We obtain an algorithm with competitive ratio of 19/12 and show that this ratio is best possible. This algorithm gives the second nontrivial example of metric spaces with better than 2 competitive ratio. The algorithm uses a design technique called the knowledge state technique - a method not specific to M-2,M-4.

关键词： algorithm design algorithm engineering Cross polytope spaces Online algorithms Randomized algorithms Server problem

来源：评论

学校读者我要写书评

暂无评论

Renewable Mobility in Smart Cities: Cloud-Based Services

Renewable Mobility in Smart Cities: Cloud-Based Services

引用

IEEE Symposium on Computers and Communications (IEEE ISCC)

作者： Gavalas, Damianos Giannakopoulou, Kalliopi Kasapakis, Vlasios Kehagias, Dionisis Konstantopoulos, Charalampos Kontogiannis, Spyros Kypriadis, Damianos Pantziou, Grammati Paraskevopoulos, Andreas Zaroliagis, Christos Univ Aegean Dept Prod & Syst Design Engn Syros Greece CTI Patras Greece Univ Patras Dept Comp Engn & Informat Patras Greece Univ Aegean Dept Cultural Technol & Commun Mitilini Greece Ctr Res & Technol Hellas Informat Technol Inst CERTH ITI Thessaloniki Greece Univ Piraeus Dept Informat Piraeus Greece Univ Ioannina Dept Comp Sci & Engn Ioannina Greece Technol Educ Inst Athens Dept Informat Athens Greece

ISBN: (纸本)9781538669501

Providing efficient, sustainable and personalized mobility services in urban environments that combine a spectrum of transport modes (e.g., public transport, electric vehicles, vehicle sharing, low energy and/or emission routes) constitutes a great challenge. In this work, we present MOVESMART, a holistic approach (and integrated platform) for the provision of renewable personal mobility services, leveraging crowd-sourcing data, tools for collecting real-time information by multimodal travelers, and traffic prediction mechanisms. MOVESMART guarantees real-time responses to renewable (on-demand) mobility queries for efficient multi-modal route planning that are time-dependent as well as sensitive to aperiodic incidents and traffic prediction forecasts. This paper focuses on the cloud-based (backend) services of the MOVESMART platform.

关键词： Sustainable mobility renewable mobility multimodal route planning crowdsourcing vehicle sharing algorithm engineering

来源：评论

学校读者我要写书评

暂无评论

Fast and simple approximation of the diameter and radius of a graph

引用

5th International Workshop on Experimental algorithms (WEA 2006)

作者： Boitmanis, Krists Freivalds, Karlis Ledins, Peteris Opmanis, Rudolfs Latvian State Univ Inst Math & Comp Sci Riga Latvia

ISBN: (纸本)3540345973

The increasing amount of data to be processed by computers has led to the need for highly efficient algorithms for various computational problems. Moreover, the algorithms should be as simple as possible to be practically applicable. In this paper we propose a very simple approximation algorithm for finding the diameter and the radius of an undirected graph. The algorithm runs in O(m root n) time and gives an additive error of O(root n) for a graph with n vertices and m edges. Practical experiments show that the results of our algorithm are close to the optimum and compare favorably to the 2/3-approximation algorithm for the diameter problem by Aingworth et al [1].

关键词： algorithm engineering analysis of algorithms approximation techniques graph algorithms graph diameter

来源：评论

学校读者我要写书评

暂无评论

Time-Dependent SHARC-Routing

引用

16th Annual European Symposium on algorithms

作者： Delling, Daniel Univ Karlsruhe TH D-76128 Karlsruhe Germany

ISBN: (纸本)3540877436

In recent years, many speed-up techniques for Dijkstra's algorithm have been developed that make the computation of shortest paths in static road networks a matter of microseconds. However, only few of those techniques work in time-dependent networks which, unfortunately, appear quite frequently in reality: Roads are predictably congested by traffic jams, and efficient timetable information systems rely on time-dependent networks. Hence, a fast technique for routing in such networks is needed. In this work, we present an efficient time-dependent route planning algorithm. It is based on our recently introduced SHARC algorithm, which we adapt by augmenting its basic ingredients such that correctness can still be guaranteed in a time-dependent scenario. As a result, we are able to efficiently compute exact shortest paths in time-dependent continental-sized transportation networks, both of roads and of railways. It should be noted that time-dependent SHARC was the first efficient algorithm for time-dependent route planning.

关键词： algorithm engineering Graph algorithms Time-dependent shortest paths Timetable information

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共15页 << < 4 5 6 7 8 9 10 11 12 13 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：