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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

59 篇 会议
3 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

50 篇 工学
- 48 篇 计算机科学与技术...
- 35 篇 软件工程
- 4 篇 电气工程
- 3 篇 信息与通信工程
- 1 篇 电子科学与技术（可...
- 1 篇 控制科学与工程
- 1 篇 化学工程与技术
20 篇 理学
- 17 篇 数学
- 2 篇 系统科学
- 1 篇 物理学
- 1 篇 化学

主题

19 篇 logic programmin...
5 篇 semantics
4 篇 computer circuit...
3 篇 well-founded sem...
3 篇 temporal logic
2 篇 linear logic
2 篇 fixpoint semanti...
2 篇 time granularity
2 篇 bottom-up evalua...
2 篇 static analysis
2 篇 computers
2 篇 automata theory
2 篇 non-monotonic re...
1 篇 intrusion detect...
1 篇 calml3 gene
1 篇 constraint logic...
1 篇 lattices
1 篇 formal logic
1 篇 prolog (programm...
1 篇 higher-order log...

机构

2 篇 univ koblenz dep...
2 篇 department of co...
2 篇 artificial intel...
2 篇 univ udine dept ...
2 篇 univ g dannunzio...
2 篇 institut für inf...
2 篇 univ genoa dipar...
2 篇 irst itc i-38050...
1 篇 facoltà di scien...
1 篇 univ ghent dept ...
1 篇 information engi...
1 篇 stanford univers...
1 篇 dept. computer s...
1 篇 liens ecole norm...
1 篇 28660-boadilla d...
1 篇 university of te...
1 篇 department of co...
1 篇 knowledge based ...
1 篇 cognitive engine...
1 篇 dipartimento di ...

作者

3 篇 you jia-huai
2 篇 stolzenburg f
2 篇 konczak kathrin
2 篇 martelli m
2 篇 schaub torsten
2 篇 montanari a
2 篇 franceschet m
2 篇 bozzano m
2 篇 gelfond michael
2 篇 brogi a
2 篇 delzanno g
2 篇 linke thomas
2 篇 dix j
2 篇 konolige kurt
1 篇 mileo alessandra
1 篇 risch v.
1 篇 shen yi-dong
1 篇 mancarella p
1 篇 wakayama toshiro
1 篇 alvaro peter

语言

61 篇 英文
1 篇 其他

检索条件"任意字段=2nd International Workshop on Non-Monotonic Extensions of Logic Programming"

共 62 条记录，以下是61-70 订阅

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

详细简洁

排序：

Implementation of a linear tabling mechanism 2nd

引用

2nd international workshop on Practical Aspects of Declarative Languages, PADL 2000

作者： Zhou, Neng-Fa Shen, Yi-Dong Yuan, Li-Yan You, Jia-Huai Department of Computer and Information Science Brooklyn College The City University of New York New YorkNY11210-2889 United States Department of Computer Science Chongqing University Chongqing400044 China Department of Computing Science University of Alberta EdmontonABT6G 2H1 Canada

ISBN: (纸本)3540669922

Delaying-based tabling mechanisms, such as the one adopted in XSB, are non-linear in the sense that the computation state of delayed calls has to be preserved. In this paper, we present the implementation of a linear tabling mechanism. The key idea is to let a call execute from the backtracking point of a former variant call if such a call exists. The linear tabling mechanism has the following advantages over non-linear ones: (1) it is relatively easy to implement;(2) it imposes no overhead on standard Prolog programs;and (3) the cut operator works as for standard Prolog programs and thus it is possible to use the cut operator to express negation-as-failure and conditionals in tabled programs. The weakness of the linear mechanism is the necessity of re-computation for computing fix-points. However, we have found that re-computation can be avoided for a large portion of calls of directly-recursive tabled predicates. We have implemented the linear tabling mechanism in B-Prolog. Experimental comparison shows that B-Prolog is close in speed to XSB and outperforms XSB when re-computation can be avoided. Concerning space efficiency, B-Prolog is an order of magnitude better than XSB for some programs. © Springer-Verlag Berlin Heidelberg 2000.

关键词： PROLOG (programming language)

来源：评论

学校读者我要写书评

暂无评论

Efficient pseudorecursive evaluation schemes for non-adaptive sparse grids 1

引用

2nd workshop on Sparse Grids and Applications, SGA 2012

作者： Buse, Gerrit Pflüger, Dirk Jacob, Riko TU München München Germany Institute for Parallel and Distributed Systems Universität Stuttgart Stuttgart Germany ETH Zurich Zurich Switzerland

ISBN: (数字)9783319045375

ISBN: (纸本)9783319045368

In this work we propose novel algorithms for storing and evaluating sparse grid functions, operating on regular (not spatially adaptive), yet potentially dimensionally adaptive grid types. Besides regular sparse grids our approach includes truncated grids, both with and without boundary grid points. Similar to the implicit data structures proposed in Feuersänger (Dünngitterverfahren für hochdimensionale elliptische partielle Differntialgleichungen. Diploma Thesis, Institut für Numerische Simulation, Universität Bonn, 2005) and Murarasu et al. (Proceedings of the 16th ACM Symposium on Principles and Practice of Parallel programming. Cambridge University Press, New York, 2011, pp. 25–34) we also define a bijective mapping from the multi-dimensional space of grid points to a contiguous index, such that the grid data can be stored in a simple array without overhead. Our approach is especially well-suited to exploit all levels of current commodity hardware, including cache-levels and vector extensions. Furthermore, this kind of data structure is extremely attractive for today’s real-time applications, as it gives direct access to the hierarchical structure of the grids, while outperforming other common sparse grid structures (hash maps, etc.) which do not match with modern compute platforms that well. For dimensionality d ≤10 we achieve good speedups on a 12 core Intel Westmere-EP NUMA platform compared to the results presented in Murarasu et al. (Proceedings of the international Conference on Computational Science—ICCS 2012. Procedia Computer Science, 2012). As we show, this also holds for the results obtained on Nvidia Fermi GPUs, for which we observe speedups over our own CPU implementation of up to 4.5 when dealing with moderate dimensionality. In high-dimensional settings, in the order of tens to hundreds of dimensions, our sparse grid evaluation kernels on the CPU outperform any other known implementation. © Springer international Publishing Switzerland 2014.

关键词： Parallel programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共7页 << < 1 2 3 4 5 6 7 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：