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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

332 篇 会议
9 册 图书

馆藏范围

337 篇 电子文献
4 种 纸本馆藏

日期分布

学科分类号

336 篇 工学
- 336 篇 计算机科学与技术...
- 107 篇 信息与通信工程
- 18 篇 软件工程
130 篇 理学
- 130 篇 数学

主题

12 篇 event-b
10 篇 multi-objective ...
8 篇 genetic programm...
8 篇 evolutionary alg...
7 篇 computers
6 篇 refinement
6 篇 formal methods
6 篇 runtime analysis
5 篇 reinforcement le...
5 篇 approximation al...
5 篇 robots
5 篇 combinatorial op...
5 篇 verification
4 篇 graph algorithms
4 篇 deep learning
4 篇 model checking
4 篇 abstract state m...
4 篇 graph theory
4 篇 theory
4 篇 machine learning

机构

6 篇 sorbonne univ li...
5 篇 swiss fed inst t...
5 篇 univ bergen dept...
5 篇 eindhoven univ t...
5 篇 univ southampton...
5 篇 zhejiang univ ui...
4 篇 univ utrecht utr...
4 篇 charles univ pra...
4 篇 univ tokyo jfli ...
4 篇 univ dusseldorf ...
3 篇 tech univ darmst...
3 篇 slovak acad sci ...
3 篇 univ warsaw inst...
3 篇 univ primorska f...
3 篇 ryerson univ dep...
3 篇 beijing univ tec...
3 篇 univ milan dipar...
3 篇 beijing univ tec...
3 篇 warsaw univ tech...
3 篇 itmo univ st pet...

作者

6 篇 doerr carola
6 篇 leuschel michael
5 篇 schewe klaus-die...
5 篇 doerr benjamin
4 篇 neumann frank
4 篇 coello carlos a....
4 篇 butler michael
4 篇 back thomas
4 篇 liefooghe arnaud
4 篇 hoang thai son
4 篇 riccobene elvini...
3 篇 neumann aneta
3 篇 bloznelis mindau...
3 篇 sudo yuichi
3 篇 yao xin
3 篇 ait-ameur yamine
3 篇 taubenfeld gadi
3 篇 bossek jakob
3 篇 snook colin
3 篇 paulusma daniel

语言

336 篇 英文
5 篇 中文

检索条件"丛书名=Lecture Notes in Computer Science - Theoretical Computer Science and General Issues"

共 341 条记录，以下是41-50 订阅

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

详细简洁

排序：

Distributed Detection of Clusters of Arbitrary Size 28th

Distributed Detection of Clusters of Arbitrary Size

引用

28th International Colloquium on Structural Information and Communication Complexity (SIROCCO)

作者： Manghiuc, Bogdan-Adrian Univ Edinburgh Sch Informat Edinburgh Scotland

ISBN: (纸本)9783030795269;9783030795276

Graph clustering is a fundamental technique in data analysis with a vast number of applications in computer science and statistics. In theoretical computer science, the problem of graph clustering has received significant research attention over the past two decades, which has led to pivotal algorithmic breakthroughs. However, the design of most graph clustering algorithms is based on complicated techniques from computational optimisation, which are not applicable for processing massive data sets stored in physically remote locations. In this work we present a novel distributed algorithm for graph clustering. Most of the previous algorithms only work for graphs with balanced-sized clusters, which restrict their applications in many practical settings. Our proposed algorithm works for graphs with clusters of arbitrary size and its performance is analysed with respect to every individual cluster. In addition, our algorithm is easy to implement, and only requires a polylogarithmic number of rounds for many graphs occurring in practice.

关键词： Distributed computing Graph clustering Randomised algorithms

来源：评论

学校读者我要写书评

暂无评论

Extensible Record Structures in Event-B 8th

Extensible Record Structures in Event-B

引用

7th International Conference on Rigorous State-Based Methods (ABZ)

作者： Fathabadi, Asieh Salehi Snook, Colin Hoang, Thai Son Dghaym, Dana Butler, Michael Univ Southampton ECS Southampton Hants England

ISBN: (纸本)9783030775421;9783030775438

Event-B is a state-based formal method for system development. The Event-B mathematical language does not support a syntax for the direct definition of structured types such as records. This paper proposes extending the Event-B language with direct record definitions. A key feature is the ability to extend records with new fields in refinement steps. The XEvent-B tool, which supports a textual representation of Event-B models, is extended to provide support for direct record definition and automatic transformation of record structures into standard Event-B elements. We demonstrate this work by modelling of the Tokeneer case study.

关键词： Formal methods

来源：评论

学校读者我要写书评

暂无评论

Causal Inference for Influence Propagation-Identifiability of the Independent Cascade Model 10th

Causal Inference for Influence Propagation-Identifiability o...

引用

10th International Conference on Computational Data and Social Networks (CSoNet)

作者： Feng, Shi Chen, Wei Tsinghua Univ IIIS Beijing Peoples R China Microsoft Res Beijing Peoples R China

ISBN: (纸本)9783030914349;9783030914332

Independent cascade (IC) model is a widely used influence propagation model for social networks. In this paper, we incorporate the concept and techniques from causal inference to study the identifiability of parameters from observational data in extended IC model with unobserved confounding factors, which models more realistic propagation scenarios but is rarely studied in influence propagation modeling before. We provide the conditions for the identifiability or unidentifiability of parameters for several special structures including the Markovian IC model, semi-Markovian IC model, and IC model with a global unobserved variable. Parameter identifiability is important for other tasks such as influence maximization under the diffusion networks with unobserved confounding factors.

关键词： Influence propagation Independent cascade model Identifiability Causal inference

来源：评论

学校读者我要写书评

暂无评论

New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem 28th

New Approximation Algorithms for the Heterogeneous Weighted ...

引用

28th International Colloquium on Structural Information and Communication Complexity (SIROCCO)

作者： Bilo, Davide Guala, Luciano Leucci, Stefano Proietti, Guido Rossi, Mirko Univ Sassari Dept Humanities & Social Sci Sassari Italy Univ Roma Tor Vergata Dept Enterprise Engn Rome Italy Univ Aquila Dept Informat Engn Comp Sci & Math Laquila Italy CNR Inst Syst Anal & Comp Sci Antonio Ruberti IASI Rome Italy Gran Sasso Sci Inst Laquila Italy

ISBN: (纸本)9783030795269;9783030795276

We study the heterogeneous weighted delivery (HWD) problem introduced in [Bartschi et al., STACS'17] where k heterogeneous mobile agents (e.g., robots, vehicles, etc.), initially positioned on vertices of an n-vertex edge-weighted graph G, have to deliver m messages. Each message is initially placed on a source vertex of G and needs to be delivered to a target vertex of G. Each agent can move along the edges of G and carry at most one message at any time. Each agent has a rate of energy consumption per unit of traveled distance and the goal is that of delivering all messages using the minimum overall amount of energy. This problem has been shown to be NP-hard even when k = 1, and is 4 rho-approximable where rho is the ratio between the maximum and minimum energy consumption of the agents. In this paper, we provide approximation algorithms with approximation ratios independent of the energy consumption rates. First, we design a polynomial-time 8approximation algorithm for k = O(root log n), closing a problem left open in [Bartschi et al., ATMOS'17]. This algorithm can be turned into a O(k)-approximation algorithm that always runs in polynomial-time, regardless of the values of k. Then, we show that HWD problem is 36-approximable in polynomial-time when each agent has one of two possible consumption rates. Finally, we design a polynomial-time (O) over tilde (log(3) n)-approximation algorithm for the general case.

关键词： Message delivery Energy consumption Delivery schedules Shortest-paths Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Acyclic, Star, and Injective Colouring: Bounding the Diameter 47th

Acyclic, Star, and Injective Colouring: Bounding the Diamete...

引用

47th International Workshop on Graph-Theoretic Concepts in computer science (WG)

作者： Brause, Christoph Golovach, Petr Martin, Barnaby Paulusma, Daniel Smith, Siani TU Bergakad Freiberg Freiberg Germany Univ Bergen Bergen Norway Univ Durham Durham England

ISBN: (纸本)9783030868376;9783030868383

We examine the effect of bounding the diameter for well-studied variants of the Colouring problem. A colouring is acyclic, star, or injective if any two colour classes induce a forest, star forest or disjoint union of vertices and edges, respectively. The corresponding decision problems are Acyclic Colouring, Star Colouring and Injective Colouring. The last problem is also known as L(1, 1)-Labelling and we also consider the framework of L(a, b)-Labelling. We prove a number of (almost-)complete complexity classifications, in particular, for Acyclic 3-Colouring, Star 3-Colouring and L(1, 2)-Labelling.

关键词： Stars

来源：评论

学校读者我要写书评

暂无评论

Linearizable Special Cases of the Quadratic Shortest Path Problem 1

引用

47th International Workshop on Graph-Theoretic Concepts in computer science (WG)

作者： Cela, Eranda Klinz, Bettina Lendl, Stefan Orlin, James B. Woeginger, Gerhard J. Wulf, Lasse Graz Univ Technol Inst Discrete Math Graz Austria Karl Franzens Univ Graz Inst Operat & Informat Syst Graz Austria MIT Sloan Sch Management 77 Massachusetts Ave Cambridge MA 02139 USA Rhein Westfal TH Aachen Dept Comp Sci Aachen Germany

ISBN: (数字)9783030868383

ISBN: (纸本)9783030868376;9783030868383

The quadratic shortest path problem (QSPP) in a directed graph asks for a directed path from a given source vertex to a given sink vertex, so that the sum of the interaction costs over all pairs of arcs on the path is minimized. We consider special cases of the QSPP that are linearizable as a shortest path problem in the sense of Bookhold. If the QSPP on a directed graph is linearizable under all possible choices of the arc interaction costs, the graph is called universally linearizable. We provide various combinatorial characterizations of universally linearizable graphs that are centered around the structure of source-to-sink paths and around certain forbidden subgraphs. Our characterizations lead to fast and simple recognition algorithms for universally linearizable graphs. Furthermore, we establish the intractability of deciding whether a concrete instance of the QSPP (with a given graph and given arc interaction costs) is linearizable.

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

The Epigenetic Consensus Problem 28th

The Epigenetic Consensus Problem

引用

28th International Colloquium on Structural Information and Communication Complexity (SIROCCO)

作者： Rashid, Sabrina Taubenfeld, Gadi Bar-Joseph, Ziv Carnegie Mellon Univ Computat Biol Dept Pittsburgh PA 15213 USA Interdisciplinary Ctr Herzliyya Israel Carnegie Mellon Univ Machine Learning Dept Pittsburgh PA 15213 USA

ISBN: (纸本)9783030795269;9783030795276

A distributed computing system is a collection of processors that communicate either by reading and writing from shared memory or by sending messages over some communication network. Most prior biologically inspired distributed computing algorithms rely on message passing as the communication model. Here we show that in the process of genome-wide epigenetic modifications, cells utilize their DNA as a shared memory system. We formulate a particular consensus problem, called the epigenetic consensus problem, that cells attempt to solve using this shared memory model and then present algorithms, derive expected run time and discuss, analyze and simulate improved methods for solving this problem. Analysis of real biological data indicates that the computational methods indeed reflect aspects of the biological process for genome-wide epigenetic modifications.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem 1

引用

47th International Workshop on Graph-Theoretic Concepts in computer science (WG)

作者： Mannens, Isja Nederlof, Jesper Swennenhuis, Celine Szilagyi, Krisztina Univ Utrecht Utrecht Netherlands Eindhoven Univ Technol Eindhoven Netherlands

ISBN: (数字)9783030868383

ISBN: (纸本)9783030868376;9783030868383

We study a variant of Min Cost Flow in which the flow needs to be connected. Specifically, in the Connected Flow problem one is given a directed graph G, along with a set of demand vertices D subset of V (G) with demands dem : D -> N, and costs and capacities for each edge. The goal is to find a minimum cost flow that satisfies the demands, respects the capacities and induces a (strongly) connected subgraph. This generalizes previously studied problems like the (Many Visits) TSP. We study the parameterized complexity of Connected Flow parameterized by |D|, the treewidth tw and by vertex cover size k of G and provide: 1. NP-completeness already for the case |D| = 2 with only unit demands and capacities and no edge costs, and fixed-parameter tractability if there are no capacities, 2. a fixed-parameter tractable O*(k(O(k))) time algorithm for the general case, and a kernel of size polynomial in k for the special case of Many Visits TSP, 3. a |V (G)|(O(tw)) time algorithm and a matching |V (G)|(o(tw)) time conditional lower bound conditioned on the Exponential Time Hypothesis. To achieve some of our results, we significantly extend an approach by Kowalik et al. [ESA'20].

关键词： Flow graphs

来源：评论

学校读者我要写书评

暂无评论

Constant Round Distributed Domination on Graph Classes with Bounded Expansion 28th

Constant Round Distributed Domination on Graph Classes with ...

引用

28th International Colloquium on Structural Information and Communication Complexity (SIROCCO)

作者： Kublenz, Simeon Siebertz, Sebastian Vigny, Alexandre Univ Bremen Bremen Germany

We show that the dominating set problem admits a constant factor approximation in a constant number of rounds in the LOCAL model of distributed computing on graph classes with bounded expansion. This generalizes a res... 详细信息

ISBN: (纸本)9783030795269;9783030795276

关键词： Dominating set LOCAL algorithm Bounded expansion graph classes

来源：评论

学校读者我要写书评

暂无评论

Validation of Formal Models by Timed Probabilistic Simulation 8th

Validation of Formal Models by Timed Probabilistic Simulatio...

引用

7th International Conference on Rigorous State-Based Methods (ABZ)

作者： Vu, Fabian Leuschel, Michael Mashkoor, Atif Univ Dusseldorf Inst Informat Dusseldorf Germany Johannes Kepler Univ Linz Inst Software Syst Engn Linz Austria

ISBN: (纸本)9783030775421;9783030775438

The validation of a formal model consists of checking its conformance with actual requirements. In the context of (Event-) B, some temporal aspects can typically be validated by LTL or CTL model checking, while other properties can be validated via interactive animation or trace replay. In this paper, we present a new simulation-based validation technique for (Event-) B models called SimB. The proposed technique uses annotations to construct simulations, taking probabilistic and real-time aspects of the models into account. In this fashion, statistical properties of a single simulation run or a series of runs can be checked (e.g., Monte Carlo estimation or hypothesis tests). SimB complements animation and model checking, and its usability has been assessed via several case studies.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：