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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

10 篇 会议
1 册 图书
1 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

8 篇 工学
- 8 篇 计算机科学与技术...
- 1 篇 电气工程
- 1 篇 信息与通信工程
- 1 篇 软件工程
6 篇 理学
- 5 篇 数学
- 2 篇 统计学（可授理学、...
- 1 篇 系统科学

主题

1 篇 data storage rep...
1 篇 hamming distance
1 篇 turing machines
1 篇 boolean function...
1 篇 software enginee...
1 篇 computability an...
1 篇 computer communi...
1 篇 database managem...
1 篇 discrete mathema...
1 篇 graph theory
1 篇 semantics
1 篇 consensus algori...
1 篇 artificial intel...
1 篇 web services
1 篇 algorithm analys...

机构

1 篇 faculty of infor...
1 篇 alpen-adria-univ...
1 篇 department of co...
1 篇 security enginee...
1 篇 university of ox...
1 篇 univ durham sch ...
1 篇 slovak universit...
1 篇 university of sz...
1 篇 university of il...
1 篇 university of il...
1 篇 faculty of mathe...
1 篇 estonská 500 100...
1 篇 reykjavik univ a...
1 篇 boston universit...
1 篇 department of co...
1 篇 univ complutense...
1 篇 department of co...
1 篇 reykjavik univ s...
1 篇 department of co...
1 篇 and university o...

作者

1 篇 ibarra oscar h.
1 篇 ingolfsdottir an...
1 篇 bieliková mária
1 篇 song jian
1 篇 žák stanislav
1 篇 mária bieliková
1 篇 paulusma daniel
1 篇 gregorio-rodrigu...
1 篇 albers susanne
1 篇 golovach petr a.
1 篇 aceto luca
1 篇 matl luboš
1 篇 šíma jiří
1 篇 vlček václav
1 篇 donahoo michael ...
1 篇 georg gottlob
1 篇 katzenbeisser st...
1 篇 jaroměřská slávk...
1 篇 eǧecioǧlu ömer
1 篇 de frutos-escrig...

语言

12 篇 英文

检索条件"任意字段=38th Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2012"

共 12 条记录，以下是1-10 订阅

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

详细简洁

排序：

sofsem 2012: theory and practice of computer science - 38th conference on current trends in theory and practice of computer science, Proceedings

SOFSEM 2012: Theory and Practice of Computer Science - 38th ...

引用

38th conference on current trends in theory and practice of computer science, sofsem 2012

ISBN: (纸本)9783642276590

the proceedings contain 53 papers. the topics discussed include: the legacy of turing in numerical analysis;turing machines for dummies: why representations do matter;what is an algorithm?;strong bridges and strong articulation points of directed graphs;towards computational models of artificial cognitive systems that can, in principle, pass the turing test;a fully generic approach for realizing the adaptive web;multi feature indexing network Mufin for similarity search applications;recent challenges and ideas in temporal synthesis;cryptography from learning parity with noise;a quick tour of word sense disambiguation, induction and related approaches;not another look at the turing test!;the equational theory of weak complete simulation semantics over BCCSP;complexity insights of the minimum duplication problem;and unique-maximum and conflict-free coloring for hypergraphs and tree graphs.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Online b-Matching with Stochastic Rewards 50th

Online b-Matching with Stochastic Rewards

引用

50th International conference on current trends in theory and practice of computer science, sofsem 2025

作者： Albers, Susanne Schubert, Sebastian Department of Computer Science Technical University of Munich Garching Germany

ISBN: (纸本)9783031826696

the b-matching problem is an allocation problem where the vertices on the left-hand side of a bipartite graph, referred to as servers, may be matched multiple times. In the setting with stochastic rewards, an assignment between an incoming request and a server turns into a match with a given success probability. Mehta and Panigrahi (FOCS 2012) introduced online bipartite matching with stochastic rewards, where each vertex may be matched once. the framework is equally interesting in graphs with vertex capacities. In Internet advertising, for instance, the advertisers seek successful matches with a large number of users. We develop (tight) upper and lower bounds on the competitive ratio of deterministic and randomized online algorithms, for b-matching with stochastic rewards. Our bounds hold for both offline benchmarks considered in the literature. As in prior work, we first consider vanishing probabilities. We show that no randomized online algorithm can achieve a competitive ratio greater than 1-1/e≈0.632, even for identical vanishing probabilities and arbitrary uniform server capacities. Furthermore, we conduct a primal-dual analysis of the deterministic StochasticBalance algorithm. We prove that it achieves a competitive ratio of 1-1/e, as server capacities increase, for arbitrary heterogeneous non-vanishing edge probabilities. this performance guarantee holds in a general setting where servers have individual capacities and for the vertex-weighted problem extension. To the best of our knowledge, this is the first result for StochasticBalance with arbitrary non-vanishing probabilities. We remark that our impossibility result implies in particular that, for the AdWords problem, no online algorithm can be better than (1-1/e)-competitive in the setting with stochastic rewards. © the Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

4-Coloring H-Free Graphs When H Is Small

4-Coloring H-Free Graphs When H Is Small

引用

38th conference on current trends in theory and practice of computer science

作者： Golovach, Petr A. Paulusma, Daniel Song, Jian Univ Durham Sch Engn & Comp Sci Sci Labs Durham DH1 3LE England

ISBN: (纸本)9783642276590;9783642276606

the k-COLORING problem is to test whether a graph can be colored with at most k colors such that no two adjacent vertices receive the same color. If a graph C does not contain a graph H as an induced subgraph, then C is called H-free. For any fixed graph H on at most 6 vertices, it is known that 3-COLORING is polynomial-time solvable on H-free graphs whenever H is a linear forest and NP-complete otherwise. By solving the missing case P-2+P-3, we prove the same result for 4-COLORING provided that H is a fixed graph on at most 5 vertices.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

A Turing machine resisting isolated bursts of faults

A Turing machine resisting isolated bursts of faults

引用

38th conference on current trends in theory and practice of computer science, sofsem 2012

作者： Çapuni, Ilir Gács, Peter Boston University Department of Computer Science 111 Cummington str Boston MA 02215 United States

ISBN: (纸本)9783642276590

We consider computations of a Turing machine under noise that causes consecutive violations of the machine's transition function. Given a constant upper bound β on the size of bursts of faults, we construct a Turing machine M(β) subject to faults that can simulate any fault-free machine under the condition that bursts not closer to each other than V for an appropriate V = O(β). © 2012 Springer-Verlag.

关键词： Turing machines

来源：评论

学校读者我要写书评

暂无评论

the Equational theory of Weak Complete Simulation Semantics over BCCSP

The Equational Theory of Weak Complete Simulation Semantics ...

引用

38th conference on current trends in theory and practice of computer science

作者： Aceto, Luca de Frutos-Escrig, David Gregorio-Rodriguez, Carlos Ingolfsdottir, Anna Reykjavik Univ Sch Comp Sci ICE TCS Reykjavik Iceland Univ Complutense Madrid Dept Sist Informat Comp Madrid Spain Reykjavik Univ Abel Extraordinary Chair Reykjavik Iceland

ISBN: (纸本)9783642276590;9783642276606

this paper presents a complete account of positive and negative results on the finite axiomatizability of weak complete simulation semantics over the language BCCSP. We offer finite (un)conditional ground-complete axiomatizations for the weak complete simulation pre-congruence. In sharp contrast to this positive result, we prove that, in the presence of at least one observable action, the (in)equational theory of the weak complete simulation precongruence over BCCSP does not have a finite (in)equational basis. In fact, the set of (in)equations in at most one variable that hold in weak complete simulation semantics over BCCSP does not have an (in)equational basis of 'bounded depth', let alone a finite one.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Generic heuristic approach to general game playing

Generic heuristic approach to general game playing

引用

38th conference on current trends in theory and practice of computer science, sofsem 2012

作者： Mańdziuk, Jacek Świechowski, Maciej Faculty of Mathematics and Information Science Warsaw University of Technology Warsaw Poland Systems Research Institute Polish Academy of Sciences Warsaw Poland

ISBN: (纸本)9783642276590

General Game Playing (GGP) is a specially designed environment for creating and testing competitive agents which can play variety of games. the fundamental motivation is to advance the development of various artificial intelligence methods operating together in a previously unknown environment. this approach extrapolates better on real world problems and follows artificial intelligence paradigms better than dedicated single-game optimized solutions. this paper presents a universal method of constructing the heuristic evaluation function for any game playable within the GGP framework. the algorithm embraces distinctive discovery of candidate features to be included in the evaluation function and learning their correlations with actions performed by the players and the game score. Our method integrates well with the UCT algorithm which is currently the state-of-the-art approach in GGP. © 2012 Springer-Verlag.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

A sufficient condition for sets hitting the class of read-once branching programs of width 3

A sufficient condition for sets hitting the class of read-on...

引用

38th conference on current trends in theory and practice of computer science, sofsem 2012

作者： Ší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: (纸本)9783642276590

We characterize the hitting sets for read-once branching programs of width 3 by a so-called richness condition which is independent of a rather technical definition of branching programs. the richness property proves to be (in certain sense) necessary and sufficient condition for such hitting sets. In particular, we show that any rich set extended with all strings within Hamming distance of 3 is a hitting set for width-3 read-once branching programs. Applying this result to an example of an efficiently constructible rich set from our previous work we achieve an explicit polynomial time construction of an Ε-hitting set for read-once branching programs of width 3 with acceptance probability Ε > 11/12. © 2012 Springer-Verlag.

关键词： Hamming distance

来源：评论

学校读者我要写书评

暂无评论

Towards a smart, self-scaling cooperative web cache

Towards a smart, self-scaling cooperative web cache

引用

38th conference on current trends in theory and practice of computer science, sofsem 2012

作者： Černý, Tomáš Praus, Petr Jaroměřská, Slávka Matl, Luboš Donahoo, Michael J. Department of Computer Science and Engineering Czech Technical University Charles Square 13 121 35 Prague 2 Czech Republic Department of Computer Science Baylor University P.O. Box 97356 Waco TX 76798-7356 United States

ISBN: (纸本)9783642276590

the traditional client/server architecture for web service delivery fails to naturally scale. this results in growing costs to the service provider for powerful hardware or extensive use of Content Distribution Networks. A P2P overlay network provides inherent scalability with multiple benefits to both clients and servers. In this paper, we provide analysis, design and prototype implementation of Cooperative Web Cache, which allows us to scale web service delivery and cope with demand spikes by employing clients in content replication. To demonstrate performance capabilities, we provide a prototype emulation for both client and server. © 2012 Springer-Verlag.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

sofsem 2012: theory and practice of computer science 1

引用

丛书名： Lecture Notes in computer science

1000年

作者： Mária Bieliková Gerhard Friedrich Georg Gottlob Stefan Katzenbeisser György Turán

ISBN: (数字)9783642276606

ISBN: (纸本)9783642276590

this book constitutes the refereed proceedings of the 38th conference on current trends in theory and practice of computer science, sofsem 2012, held in Špindlerův Mlýn, Czech Republic, in January 2012. the 43 revised papers presented in this volume were carefully reviewed and selected from 121 submissions. the book also contains 11 invited talks, 10 of which are in full-paper length. the contributions are organized in topical sections named: foundations of computer science; software and Web engineering; cryptography, security, and verification; and artificial intelligence.

关键词： Algorithm Analysis and Problem Complexity Software Engineering Data Storage Representation Discrete Mathematics in computer science computer Communication Networks Database Management

来源：评论

学校读者我要写书评

暂无评论

Multitape NFA: Weak synchronization of the input heads

Multitape NFA: Weak synchronization of the input heads

引用

38th conference on current trends in theory and practice of computer science, sofsem 2012

作者： Eǧecioǧlu, Ömer Ibarra, Oscar H. Tran, Nicholas Q. Department of Computer Science University of California Santa Barbara CA 93106 United States Department of Mathematics and Computer Science Santa Clara University Santa Clara CA 95053 United States

ISBN: (纸本)9783642276590

Given an n-tape nondeterministic finite automaton (NFA) M with a one-way read-only head per tape and a right end marker $ on each tape, and a nonnegative integer k, we say that M is weakly k-synchronized if for every n-tuple x = (x1, ..., xn) that is accepted, there is a computation on x such that at any time during the computation, no pair of input heads, neither of which is on $, are more than k cells apart. As usual, an n-tuple x = (x1, ..., xn ) is accepted if M eventually reaches the configuration where all n heads are on $ in an accepting state. We show decidable and undecidable results concerning questions such as: (1) Given M, is it weakly k-synchronized for some k (resp., for a specified k) and (2) Given M, is there a weakly k-synchronized M′ for some k (resp., for a specified k) such that L(M′) = L(M)? Most of our results are the strongest possible in the sense that slight restrictions on the models make the undecidable problems decidable. A few questions remain open. © 2012 Springer-Verlag.

关键词： Computability and decidability

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共2页 << < 1 2 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：