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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

240 篇 期刊文献
203 篇 会议
2 册 图书

馆藏范围

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

日期分布

学科分类号

321 篇 理学
- 302 篇 数学
- 29 篇 统计学（可授理学、...
- 22 篇 系统科学
- 19 篇 物理学
- 12 篇 生物学
- 3 篇 化学
- 3 篇 地球物理学
230 篇 工学
- 166 篇 计算机科学与技术...
- 109 篇 软件工程
- 39 篇 土木工程
- 36 篇 建筑学
- 23 篇 测绘科学与技术
- 18 篇 材料科学与工程（可...
- 17 篇 控制科学与工程
- 16 篇 信息与通信工程
- 12 篇 电子科学与技术（可...
- 8 篇 电气工程
- 7 篇 机械工程
- 7 篇 生物工程
- 4 篇 光学工程
- 4 篇 农业工程
- 4 篇 生物医学工程（可授...
- 3 篇 化学工程与技术
- 3 篇 交通运输工程
53 篇 管理学
- 29 篇 图书情报与档案管...
- 25 篇 管理科学与工程(可...
- 11 篇 工商管理
7 篇 农学
- 7 篇 作物学
6 篇 法学
- 6 篇 社会学
4 篇 经济学
- 4 篇 应用经济学
1 篇 教育学
1 篇 医学
1 篇 军事学

主题

27 篇 parameterization
21 篇 graph theory
18 篇 approximation al...
17 篇 polynomial appro...
15 篇 graphic methods
13 篇 trees (mathemati...
11 篇 visualization
11 篇 parameter estima...
10 篇 computational co...
10 篇 algorithm design...
10 篇 directed graphs
9 篇 optimization
9 篇 clustering algor...
8 篇 drawing (graphic...
8 篇 hamiltonians
7 篇 evolutionary alg...
7 篇 constraint satis...
7 篇 evolutionary com...
6 篇 runtime
6 篇 integer programm...

机构

227 篇 algorithms and c...
18 篇 hamburg universi...
17 篇 department of in...
16 篇 department of co...
13 篇 algorithms and c...
9 篇 indian institute...
8 篇 school of comput...
8 篇 hamburg universi...
6 篇 algorithms and c...
6 篇 faculty of infor...
5 篇 school of comput...
5 篇 school of comput...
5 篇 department of in...
5 篇 cispa helmholtz ...
5 篇 department of ap...
5 篇 department of ma...
4 篇 university of le...
4 篇 department of en...
4 篇 department of al...
4 篇 department of en...

作者

85 篇 ganian robert
69 篇 nöllenburg marti...
47 篇 szeider stefan
31 篇 eiben eduard
31 篇 bhore sujoy
27 篇 mnich matthias
27 篇 ordyniak sebasti...
18 篇 simonov kirill
17 篇 hamm thekla
17 篇 klute fabian
16 篇 ramanujan m.s.
14 篇 kanj iyad
14 篇 wallinger markus
14 篇 montecchiani fab...
12 篇 golovach petr a.
12 篇 li guangping
12 篇 wulms jules
12 篇 fomin fedor v.
11 篇 neumann frank
11 篇 rutter ignaz

语言

424 篇 英文
20 篇 其他
1 篇 中文

检索条件"机构=Algorithms and Complexity"

共 445 条记录，以下是101-110 订阅

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

详细简洁

排序：

On existential MSO and its relation to ETH 41

On existential MSO and its relation to ETH

引用

41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016

作者： Ganian, Robert De Haan, Ronald Kanj, Iyad Szeider, Stefan Algorithms and Complexity Group TU Wien Vienna Austria School of Computing DePaul University ChicagoIL United States

ISBN: (纸本)9783959770163

Impagliazzo et al. proposed a framework, based on the logic fragment defining the complexity class SNP, to identify problems that are equivalent to k-CNF-Sat modulo subexponential-time reducibility (serf-reducibility). The subexponential-time solvability of any of these problems implies the failure of the Exponential Time Hypothesis (ETH). In this paper, we extend the framework of Impagliazzo et al., and identify a larger set of problems that are equivalent to k- CNF-Sat modulo serf-reducibility. We propose a complexity class, referred to as Linear Monadic NP, that consists of all problems expressible in existential monadic second order logic whose expressions have a linear measure in terms of a complexity parameter, which is usually the universe size of the problem. This research direction can be traced back to Fagin's celebrated theorem stating that NP coincides with the class of problems expressible in existential second order logic. Monadic NP, a well-studied class in the literature, is the restriction of the aforementioned logic fragment to existential monadic second order logic. The proposed class Linear Monadic NP is then the restriction of Monadic NP to problems whose expressions have linear measure in the complexity parameter. We show that Linear Monadic NP includes many natural complete problems such as the satisfiability of linear-size circuits, dominating set, independent dominating set, and perfect code. Therefore, for any of these problems, its subexponential-time solvability is equivalent to the failure of ETH. We prove, using logic games, that the aforementioned problems are inexpressible in the monadic fragment of SNP, and hence, are not captured by the framework of Impagliazzo et al. Finally, we show that Feedback Vertex Set is inexpressible in existential monadic second order logic, and hence is not in Linear Monadic NP, and investigate the existence of certain reductions between Feedback Vertex Set (and variants of it) and 3-CNF-Sat. © Cody Geary

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

On structures and behaviors of spiking neural P systems and Petri nets

On structures and behaviors of spiking neural P systems and ...

引用

13th International Conference on Membrane Computing, CMC 2012

作者： Cabarle, Francis George C. Adorna, Henry N. Algorithms and Complexity Lab. Department of Computer Science University of the Philippines Diliman Diliman 1101 Quezon City Philippines

ISBN: (纸本)9783642367502

In this work we investigate further the relationship between Petri nets and Spiking Neural P (SNP) systems: we consider SNP systems that have source (no incoming synapse) and sink (no outgoing synapse) neurons, and the initial configuration of the system is where only the source neuron has only one spike. We then route the initial single spike through the system to the sink neuron, using routing constructs. This type of SNP systems are similar to Petri nets, in particular to Workflow (WF) nets. We observe structural and behavioral properties of these nets for routing a single token can be simulated by SNP systems with source and sink neurons. Certain routing types such as AND-splits and OR-joins are 'natural' in SNP systems, but AND-joins and especially OR-splits seem to be more complex. Our results also suggest the possibility of analysing workflows using SNP systems. © 2013 Springer-Verlag.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

Navigating Social Networks: A Hypergraph Approach to Influence Optimization 9

Navigating Social Networks: A Hypergraph Approach to Influen...

引用

9th International Conference on complexity, Future Information Systems and Risk, COMPLEXIS 2024

作者： Enduri, Murali Krishna Algorithms and Complexity Theory Lab Department of Computer Science and Engineering SRM University-AP Andrapradesh Amaravati522503 India

ISBN: (纸本)9789897586989

In this study, we introduce a novel approach to influence optimization in social networks by leveraging the mathematical framework of hypergraphs. Traditional centrality measures often fall short in capturing the multi-dimensional nature of influence. To address this gap, we propose the Spreading Influence (SI) model, a sophisticated tool designed to quantify the propagation potential of nodes more accurately within hypergraphs. Our research embarked on a comparative analysis using the Susceptible-Infected-Recovered (SIR) model across four distinct scenarios-where the top 5, 10, 15, and 20 nodes were initially infected-in four diverse datasets: Amazon, DBLP, Email-Enron, and Cora. The SI model's performance was benchmarked against established centrality measures: Hyperdegree Centrality (HDC), Closeness Centrality (CC), Betweenness Centrality (BC), and Hyperedge Degree Centrality (HEDC). The findings underscored the SI model's consistently superior performance in predicting influence spread. In scenarios involving the top 10 nodes, the model exhibited up to 3.18% increased influence spread over HDC, 2.14% over CC, 1.04% over BC, and 1.69% over HEDC. This indicates a substantial improvement in identifying key influencers within networks. Copyright © 2024 by SCITEPRESS - Science and Technology Publications, Lda.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Towards a polynomial kernel for directed feedback vertex set 42

Towards a polynomial kernel for directed feedback vertex set

引用

42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017

作者： Bergougnoux, Benjamin Eiben, Eduard Ganian, Robert Ordyniak, Sebastian Ramanujan, M.S. Université Clermont Auvergne LIMOS CNRS Aubière France Algorithms and Complexity Group TU Wien Vienna Austria

ISBN: (纸本)9783959770460

In the Directed Feedback Vertex Set (DFVS) problem, the input is a directed graph D and an integer k. The objective is to determine whether there exists a set of at most k vertices intersecting every directed cycle of D. DFVS was shown to be fixed-parameter tractable when parameterized by solution size by Chen, Liu, Lu, O'Sullivan and Razgon [JACM 2008];since then, the existence of a polynomial kernel for this problem has become one of the largest open problems in the area of parameterized algorithmics. In this paper, we study DFVS parameterized by the feedback vertex set number of the underlying undirected graph. We provide two main contributions: a polynomial kernel for this problem on general instances, and a linear kernel for the case where the input digraph is embeddable on a surface of bounded genus. © Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, and M. S. Ramanujan;licensed under Creative Commons License CC-BY.

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

Extending partial 1-planar drawings 47

Extending partial 1-planar drawings

引用

47th International Colloquium on Automata, Languages, and Programming, ICALP 2020

作者： Eiben, Eduard Ganian, Robert Hamm, Thekla Klute, Fabian Nöllenburg, Martin Department of Computer Science Royal Holloway University of London Egham United Kingdom Algorithms and Complexity Group TU Wien Austria

ISBN: (纸本)9783959771382

Algorithmic extension problems of partial graph representations such as planar graph drawings or geometric intersection representations are of growing interest in topological graph theory and graph drawing. In such an extension problem, we are given a tuple (G, H, H) consisting of a graph G, a connected subgraph H of G and a drawing H of H, and the task is to extend H into a drawing of G while maintaining some desired property of the drawing, such as planarity. In this paper we study the problem of extending partial 1-planar drawings, which are drawings in the plane that allow each edge to have at most one crossing. In addition we consider the subclass of IC-planar drawings, which are 1-planar drawings with independent crossings. Recognizing 1-planar graphs as well as IC-planar graphs is NP-complete and the NP-completeness easily carries over to the extension problem. Therefore, our focus lies on establishing the tractability of such extension problems in a weaker sense than polynomial-time tractability. Here, we show that both problems are fixed-parameter tractable when parameterized by the number of edges missing from H, i.e., the edge deletion distance between H and G. The second part of the paper then turns to a more powerful parameterization which is based on measuring the vertex+edge deletion distance between the partial and complete drawing, i.e., the minimum number of vertices and edges that need to be deleted to obtain H from G. © Eduard Eiben, Robert Ganian, Thekla Hamm, Fabian Klute, and Martin Nöllenburg;licensed under Creative Commons License CC-BY 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020).

关键词： Parameterization

来源：评论

学校读者我要写书评

暂无评论

Safe component updates 06

Safe component updates

引用

5th International Conference on Generative Programming and Component Engineering, GPCE'06. Co-located with the 21st International Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2006

作者： Stuckenholz, Alexander Osterloh, Andre Department of Data Processing Technologies FernUniversität Hagen Germany Department of Algorithms and Complexity FernUniversität Hagen Germany

ISBN: (纸本)1595932372

Component updates always imply the risk of negatively influencing the operability of software systems. Because of wrong combinations of component versions, dependencies might break, methods which do no longer exist, might be called or methods might not be compatible to provided interfaces, objects, or classes. In this paper we model the problem of finding a well-configured system consisting of multiple component versions as a Boolean Optimization Problem. We introduce objective functions and constraints, which use Branch-and-Bound for restricting the search space and yield most recent, minimal systems. Copyright © 2006 ACM.

关键词： Software engineering

来源：评论

学校读者我要写书评

暂无评论

Worbel: Aggregating Point Labels into Word Clouds 21

Worbel: Aggregating Point Labels into Word Clouds

引用

29th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, SIGSPATIAL 2021

作者： Bhore, Sujoy Ganian, Robert Li, Guangping Nöllenburg, Martin Wulms, Jules Indian Institute of Science Education and Research Bhopal Bhopal India Algorithms and Complexity Group Tu Wien Vienna Austria

ISBN: (纸本)9781450386647

Point feature labeling is a classical problem in cartography and GIS that has been extensively studied for geospatial point data. At the same time, word clouds are a popular visualization tool to show the most important words in text data which has also been extended to visualize geospatial data (Buchin et al. PacificVis 2016). In this paper, we study a hybrid visualization, which combines aspects of word clouds and point labeling. In the considered setting, the input data consists of a set of points grouped into categories and our aim is to place multiple disjoint and axis-aligned rectangles, each representing a category, such that they cover points of (mostly) the same category under some natural quality constraints. In our visualization, we then place category names inside the computed rectangles to produce a labeling of the covered points which summarizes the predominant categories globally (in a word-cloud-like fashion) while locally avoiding excessive misrepresentation of points (i.e., retaining the precision of point labeling). We show that computing a minimum set of such rectangles is NP-hard. Hence, we turn our attention to developing heuristics and exact SAT models to compute our visualizations. We evaluate our algorithms quantitatively, measuring running time and quality of the produced solutions, on several artificial and real-world data sets. Our experiments show that the heuristics produce solutions of comparable quality to the SAT models while running much faster. © 2021 ACM.

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

A Mathematical Runtime Analysis of the Non-dominated Sorting Genetic Algorithm III (NSGA-III)

A Mathematical Runtime Analysis of the Non-dominated Sorting...

引用

2024 Genetic and Evolutionary Computation Conference Companion, GECCO 2024 Companion

作者： Wietheger, Simon Doerr, Benjamin Algorithms and Complexity Group TU Wien Vienna Austria École Polytechnique CNRS Institut Polytechnique de Paris Palaiseau France

ISBN: (纸本)9798400704956

The Non-dominated Sorting Genetic Algorithm II (NSGA-II) is the most prominent multi-objective evolutionary algorithm for real-world applications. While it performs evidently well on bi-objective optimization problems, empirical studies suggest that it is less effective when applied to problems with more than two objectives. A recent mathematical runtime analysis confirmed this observation by proving that the NGSA-II for an exponential number of iterations misses a constant factor of the Pareto front of the simple m-objective OneMinMax problem when m ≥ *** this work, we provide the first mathematical runtime analysis of the NSGA-III, a refinement of the NSGA-II aimed at better handling more than two objectives. We prove that the NSGA-III with sufficiently many reference points - a small constant factor more than the size of the Pareto front, as suggested for this algorithm - computes the complete Pareto front of the 3-objective OneMinMax benchmark in an expected number of O(n log n) iterations. This result holds for all population sizes (that are at least the size of the Pareto front). It shows a drastic advantage of the NSGA-III over the NSGA-II on this *** paper for the Hot-off-the-Press track at GECCO 2024 summarizes the work Simon Wietheger and Benjamin Doerr. A mathematical runtime analysis of the Non-dominated Sorting Genetic Algorithm III (NSGA-III). In International Joint Conference on Artificial Intelligence, IJCAI 2023. 5657 - 5665, 2023. [15]. © 2024 Copyright held by the owner/author(s).

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

SAT-Based Generation of Planar Graphs 26

SAT-Based Generation of Planar Graphs

引用

26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023

作者： Markus Kirchweger Manfred Scheucher Stefan Szeider Algorithms and Complexity Group TU Wien Austria Institut för Mathematik Technische Universität Berlin Germany

ISBN: (纸本)9783959772860

To test a graph's planarity in SAT-based graph generation we develop SAT encodings with dynamic symmetry breaking as facilitated in the SAT modulo Symmetry (SMS) framework. We implement and compare encodings based on three planarity criteria. In particular, we consider two eager encodings utilizing order-based and universal-set-based planarity criteria, and a lazy encoding based on Kuratowski's theorem. The performance and scalability of these encodings are compared on two prominent problems from combinatorics: The computation of planar Turán numbers and the Earth-Moon problem. We further showcase the power of SMS equipped with a planarity encoding by verifying and extending several integer sequences from the Online Encyclopedia of Integer Sequences (OEIS) related to planar graph enumeration. Furthermore, we extend the SMS framework to directed graphs which might be of independent interest. © 2023 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. All rights reserved.

关键词： Moon

来源：评论

学校读者我要写书评

暂无评论

Patterns and outlier analysis of traffic flow using data signatures via iDIRBrG method and vector fusion visualization

Patterns and outlier analysis of traffic flow using data sig...

引用

2010 3rd International Conference on Human-Centric Computing, HumanCom 2010

作者： Malinao, Jasmine A. Juayong, Richelle Ann B. Becerral, Jona G. Cabreros, Karmina Rosette C. Remaneses, Ken Marvi B. Khaw, Jason G. Wuysang, Danny F. Corpuz, Francis James O. Hernandez, Nestine Hope S. Yap, Jan Michael C. Adorna, Henry N. Algorithms and Complexity Laboratory Department of Computer Science University of Philippines Velasquez Ave. Diliman Quezon City 1101 Philippines

ISBN: (纸本)9781424475704

In this paper, we used X-Means clustering algorithm, incorporated data images from a so-called Iterative Data Image Rotated Bar Graph (iDIRBrG) method (formerly referred as BC method) and used Vector Fusion Visualization to achieve better traffic data analysis results compared to our previous work by improving how data signatures are constructed from the raw data set. By doing so, we effectively identify more patterns, extracted known as well as unexpected outliers, and novel information from the data set. These results were validated by experts from the NCTS. Furthermore, we also show more simplistic frequency-domain 2D visualizations of the entire data set. These successfully expose the internal structure and relationship of each individual point as well as the clusters obtained from it. Hence, using the methods above, we provide an effective and efficient time series traffic analysis. © 2010 IEEE.

关键词： Power spectrum

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共45页 << < 7 8 9 10 11 12 13 14 15 16 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：