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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

107 篇 会议
6 册 图书
1 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

82 篇 工学
- 77 篇 计算机科学与技术...
- 33 篇 软件工程
- 8 篇 信息与通信工程
- 6 篇 控制科学与工程
- 3 篇 机械工程
- 3 篇 电气工程
- 3 篇 电子科学与技术（可...
- 3 篇 交通运输工程
- 2 篇 光学工程
- 2 篇 生物医学工程（可授...
- 2 篇 生物工程
- 1 篇 仪器科学与技术
- 1 篇 动力工程及工程热...
- 1 篇 船舶与海洋工程
- 1 篇 航空宇航科学与技...
- 1 篇 安全科学与工程
21 篇 理学
- 18 篇 数学
- 5 篇 统计学（可授理学、...
- 3 篇 物理学
- 2 篇 生物学
- 1 篇 系统科学
13 篇 管理学
- 7 篇 管理科学与工程(可...
- 7 篇 图书情报与档案管...
- 2 篇 工商管理
4 篇 教育学
- 4 篇 教育学
2 篇 医学
- 2 篇 基础医学(可授医学...
- 2 篇 临床医学
- 1 篇 公共卫生与预防医...
- 1 篇 药学(可授医学、理...
1 篇 法学
- 1 篇 社会学

主题

11 篇 computer science
7 篇 graph theory
5 篇 automata theory
5 篇 constraint theor...
4 篇 software enginee...
3 篇 interactive comp...
3 篇 computer archite...
3 篇 requirements eng...
3 篇 data structures
2 篇 computer simulat...
2 篇 information syst...
2 篇 theory of comput...
2 篇 approximation al...
2 篇 social robots
2 篇 application soft...
2 篇 systems engineer...
2 篇 collaborative so...
2 篇 medical services
2 篇 computer graphic...
2 篇 monitoring

机构

2 篇 institute of com...
2 篇 univ washington ...
1 篇 university of ca...
1 篇 univ coll cork i...
1 篇 ist austria klos...
1 篇 department of el...
1 篇 cleveland state ...
1 篇 school of comput...
1 篇 department of el...
1 篇 penn state univ ...
1 篇 univ kassel fach...
1 篇 univ wroclaw ins...
1 篇 department of co...
1 篇 school of applie...
1 篇 katholieke univ ...
1 篇 xidian univ inst...
1 篇 univ grenoble 1 ...
1 篇 engineering prof...
1 篇 singapore univer...
1 篇 univ durham sch ...

作者

2 篇 žák stanislav
2 篇 šíma jiří
2 篇 otto friedrich
2 篇 henzinger thomas...
1 篇 lee dae sung
1 篇 ratliff lillian
1 篇 elie saad
1 篇 moustafa a. fouz
1 篇 cuong dinh v
1 篇 lin xiaodong
1 篇 yuming jiang
1 篇 rasekh nima
1 篇 renault guenael
1 篇 giguette marguer...
1 篇 qingjun xiao
1 篇 t.w. griffin
1 篇 wu dan
1 篇 liang yung c.
1 篇 pierce james
1 篇 li ronghui

语言

113 篇 英文
1 篇 中文

检索条件"任意字段=33rd Conference on Current Trends in Theory and Practice of Computer Science"

共 114 条记录，以下是21-30 订阅

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

详细简洁

排序：

Weighted nearest neighbor algorithms for the graph exploration problem on cycles

Weighted nearest neighbor algorithms for the graph explorati...

引用

33rd conference on current trends in theory and practice of computer science

作者： Asahiro, Yuichi Miyano, Eiji Miyazaki, Shuichi Yoshimuta, Takuro Kyushu Sangyo Univ Dept Social Informat Syst Fukuoka 8138503 Japan Kyushu Inst Technol Dept Syst Design & Informat Fukuoka 8208502 Japan Kyoto Univ Acad Ctr Comp & Media Studies Kyoto 6068501 Japan

ISBN: (纸本)9783540695066

In the graph exploration problem, a searcher explores the whole set of nodes of an unknown graph. The searcher is not aware of the existence of an edge until he/she visits one of its endpoints. The searcher's task is to visit all the nodes and go back to the starting node by traveling as a short tour as possible. One of the simplest strategies is the nearest neighbor algorithm (NN), which always chooses the unvisited node nearest to the searcher's current position. The weighted NN (WNN) is an extension of NN, which chooses the next node to visit by using the weighted distance. It is known that WNN with weight 3 is 16-competitive for planar graphs. In this paper we prove that NN achieves the competitive ratio of 1.5 for cycles. In addition, we show that the analysis for the competitive ratio of NN is tight by providing an instance for which the bound of 1.5 is attained, and NN is the best for cycles among WNN with all possible weights. Furthermore, we prove that no online algorithm is better than 1.25-competitive.

关键词： computer graphics

来源：评论

学校读者我要写书评

暂无评论

Exact MAX 2-SAT: Easier and faster

Exact MAX 2-SAT: Easier and faster

引用

33rd conference on current trends in theory and practice of computer science

作者： Furer, Martin Kasiviswanathan, Shiva Prasad Penn State Univ University Pk PA 16802 USA

ISBN: (纸本)9783540695066

Prior algorithms known for exactly solving MAX 2-SAT improve upon the trivial upper bound only for very sparse instances. We present new algorithms for exactly solving (in fact, counting) weighted MAX 2-SAT instances. One of them has a good performance if the underlying constraint graph has a small separator decomposition, another has a slightly improved worst case performance. For a 2-SAT instance F with n variables, the worst case running time is (O) over tilde (2((1-1/((d) over tilde (F)-1))n)), where d(F) is the average degree in the constraint graph defined by F. We use strict a-gadgets introduced by Trevisan, Sorkin, Sudan, and Williamson to get the same upper bounds for problems like MAX 3-SAT and MAX CUT. We also introduce a notion of strict (alpha,beta)-gadget to provide a framework that allows composition of gadgets. This framework allows us to obtain the same upper bounds for MAX k-SAT and MAX k-LIN-2.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Innovative Application of Genetic Algorithms in the computer Games 33

Innovative Application of Genetic Algorithms in the Computer...

引用

第33届中国控制与决策会议

作者： Jun Tao Gui Wu Zhentong Yi Peng Zeng School of Artificial Intelligence Jianghan University Department of Electrical&Computer Engineering Rowan University Educational Administration office Jianghan University Graduate School Jianghan University

ISBN: (纸本)9781665431293

The traditional methods to solve the computer games problem are to use various search algorithms on the game search tree and to combine the situation evaluation to generate the corresponding *** paper introduces the innovative genetic algorithms to the computer games based on the traditional *** the operations for the search tree such as selection,crossover and mutation,the better search tree can be gotten from the better *** the same time,the application of the evaluation functions can produce the best steps in the current *** advanced and modified genetic algorithms are proved to be practical and applicative by experimentations and tests of computer games.

关键词： computer Games Genetic Algorithm Search Tree Search Algorithms

来源：评论

学校读者我要写书评

暂无评论

Indexing factors with gaps

Indexing factors with gaps

引用

33rd conference on current trends in theory and practice of computer science, SOFSEM 2007

作者： Sohel Rahman, M. Iliopoulos, Costas S. Algorithm Design Group Department of Computer Science King's College London Strand London WC2R 2LS United Kingdom Department of CSE BUET Dhaka-1000 Bangladesh

ISBN: (纸本)9783540695066

Indexing of factors is a widely used and useful technique in stringology and can be seen as a tool in solving diverse text algorithmic problems. A gapped-factor is a concatenation of a factor of length k, a gap of length d and another factor of length k′. The problem of indexing the gapped-factors was considered recently by [18]. In this paper, we present a new improved indexing scheme for the gapped-factors. © Springer-Verlag Berlin Heidelberg 2007.

关键词： Indexing (of information)

来源：评论

学校读者我要写书评

暂无评论

Quantum Cognition-Inspired EEG-based Recommendation via Graph Neural Networks 24

Quantum Cognition-Inspired EEG-based Recommendation via Grap...

引用

33rd ACM International conference on Information and Knowledge Management (CIKM)

作者： Han, Jinkun Li, Wei Li, Yingshu Cai, Zhipeng Georgia State Univ Dept Comp Sci Atlanta GA 30303 USA

ISBN: (纸本)9798400704369

current recommendation systems recommend goods by considering users' historical behaviors, social relations, ratings, and other multi-modals. Although outdated user information presents the trends of a user's interests, no recommendation system can know the users' real-time thoughts indeed. With the development of brain-computer interfaces, it is time to explore next-generation recommenders that show users' real-time thoughts without delay. Electroencephalography (EEG) is a promising method of collecting brain signals because of its convenience and mobility. currently, there is only few research on EEG-based recommendations due to the complexity of learning human brain activity. To explore the utility of EEG-based recommendation, we propose a novel neural network model, QUARK, combining Quantum Cognition theory and Graph Convolutional Networks for accurate item recommendations. Compared with the state-of-the-art recommendation models, the superiority of QUARK is confirmed via extensive experiments.

关键词： Recommendation System Quantum Cognition theory Graph Neural Network EEG Data Personalization

来源：评论

学校读者我要写书评

暂无评论

Interaction and readability

Interaction and readability

引用

33rd conference on current trends in theory and practice of computer science, SOFSEM 2007

作者： Broy, Manfred Institut für Informatik Technische Universität München D-80290 München Germany

ISBN: (纸本)9783540695066

We deal with the issue of realizability and computability of interactive interface behaviors as described in [1]. We treat the following aspects of interactive behaviors that are represented by relations between communication streams: Causality between input and output streams Realizability of single output histories for given input histories The role of non-realizable output in specific system contexts and for composition Relating non-realizable behaviors to state machines The concept of interactive computation and computability Finally, we relate our results to classical notions of computability. The main goal of this paper is the characterization of a general concept of interactive interface behavior as basis for the extension and generalization of the notion of computability to interactive behaviors. © Springer-Verlag Berlin Heidelberg 2007.

关键词： Interactive computer systems

来源：评论

学校读者我要写书评

暂无评论

Design and Development of Teaching System for Manipulator Simulation Control 33

Design and Development of Teaching System for Manipulator Si...

引用

第33届中国控制与决策会议

作者： Yunduo Jiang Yihe Yang Chunfeng Shao Shuying Zhao College of Information Science and Engineering Northeastern University College of Mechanical Engineering Northeastern University

ISBN: (纸本)9781665431293

The Manipulator is widely used in the current industrial field,and its teaching has a strong theoretical and practical ***,traditional theoretical teaching is often out of touch with practice,resulting in poor teaching *** paper develops a teaching software system for Manipulator simulation control,provides an interactive and visual learning platform for Manipulator principles,and deepens its understanding of teaching content through PBL teaching,reduces the difficulty of course learning,and improves students Interest in learning.

关键词： Manipulator simulation Control Teaching system design PBL December

来源：评论

学校读者我要写书评

暂无评论

Experimental assessment of the practicality of a fault-tolerant system

Experimental assessment of the practicality of a fault-toler...

引用

33rd conference on current trends in theory and practice of computer science

作者： Kim, Jai Wug Lee, Jongpil Yeom, Heon Y. Seoul Natl Univ Sch Comp Sci & Engn Seoul 151742 South Korea

ISBN: (纸本)9783540695066

Fault-tolerance has gained renewed importance with the proliferation of high-performance clusters. However, fault-tolerant systems have not yet been widely adopted commercially because they are either hard to deploy, hard to use, hard to manage, hard to maintain, or hard to justify. We have developed M-3, a practical and easily-deployable multiple fault-tolerant MPI system for Myrinet, to satisfy the demand for a fault-tolerant system. In this paper, we run rigorous tests using real-world applications to validate that M-3 can be used in commercial clusters. We also describe improvements made to our system to solve various problems that arose when deploying it on a commercial cluster. This paper models our system's checkpoint overhead and presents the results of a series of tests using computation- and communication-intensive MPI applications used commercially in various fields of science. The experimental results show that not only does our system conform to various types of running environment well, but that it can also be practically deployed in commercial clusters.

关键词： Fault tolerant computer systems

来源：评论

学校读者我要写书评

暂无评论

Research on Thread Optimization and Opening Library Based on Parallel PVS Algorithm in Amazon Chess 33

Research on Thread Optimization and Opening Library Based on...

引用

第33届中国控制与决策会议

作者： Jingyuan Ju Hongkun Qiu FuShuai Wang XueJie Wang YaJie Wang School of Artificial Intelligence Academy Shenyang Aerospace University School of Computer Science Shenyang Aerospace University Engineering Training Center Shenyang Aerospace University College of Automation Shenyang Aerospace University

ISBN: (纸本)9781665431293

This paper introduces the main algorithms used in Amazon game system,and mainly studies the number of threads in parallel PVS algorithm based on *** view of the low utilization of computer hardware by the current algorithm,this paper improves the efficiency of the algorithm by changing the number of parallel algorithm threads to be equal to the number of CPU cores,and draws a conclusion that the multi-core resources can be maximized when the number of parallel algorithm threads is equal to the number of CPU *** paper studies the design of the opening Library of Amazon chess,puts forward the design idea of the opening Library of Amazon chess and the necessity of the opening library system.

关键词： computer Game Amazon Game Search algorithm Parallel efficiency Opening library

来源：评论

学校读者我要写书评

暂无评论

A polynomial time constructible hitting set for restricted 1-branching programs of Width 3

A polynomial time constructible hitting set for restricted 1...

引用

33rd conference on current trends in theory and practice of computer science, SOFSEM 2007

作者： Šíma, Jiří Žák, Stanislav Institute of Computer Science Academy of Sciences of the Czech Republic P. O. Box 5 18207 Prague 8 Czech Republic

ISBN: (纸本)9783540695066

An important problem in complexity theory is to find polynomial time constructible hitting sets for Boolean functions in different standard models. This would have consequences for the relationship between deterministic and probabilistic computations in the respective models. Using the result by Alon, Goldreich, Håstad, and Peralta (1992) we provide a polynomial time constructible hitting set for restricted readonce branching programs of width 3. The restriction excludes only one from all patterns of level-to-level transitions in a normalized form of 3-width 1-branching programs. In fact, our technique works for a slightly more general class of such programs. Although this restriction seems to be relatively strong our proof reveals the core of difficulties and thus represents the first step for proving the result for less restricted models. © Springer-Verlag Berlin Heidelberg 2007.

关键词： Polynomials

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共12页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：