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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

172 篇 会议
7 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

115 篇 工学
- 96 篇 计算机科学与技术...
- 48 篇 软件工程
- 16 篇 电气工程
- 12 篇 控制科学与工程
- 10 篇 信息与通信工程
- 5 篇 电子科学与技术（可...
- 4 篇 光学工程
- 3 篇 仪器科学与技术
- 3 篇 生物医学工程（可授...
- 2 篇 机械工程
- 2 篇 化学工程与技术
- 2 篇 交通运输工程
- 2 篇 生物工程
- 1 篇 材料科学与工程（可...
- 1 篇 冶金工程
64 篇 理学
- 57 篇 数学
- 11 篇 统计学（可授理学、...
- 6 篇 物理学
- 3 篇 生物学
- 2 篇 化学
- 2 篇 系统科学
- 1 篇 地球物理学
20 篇 管理学
- 13 篇 管理科学与工程(可...
- 12 篇 工商管理
- 4 篇 图书情报与档案管...
8 篇 经济学
- 6 篇 应用经济学
- 2 篇 理论经济学
5 篇 医学
- 4 篇 临床医学
- 3 篇 基础医学(可授医学...
1 篇 教育学
- 1 篇 教育学

主题

42 篇 approximation al...
10 篇 approximation me...
9 篇 polynomial appro...
7 篇 social networkin...
6 篇 algorithms
6 篇 algorithm design...
5 篇 least squares ap...
4 篇 computational mo...
4 篇 frequency
4 篇 bayesian methods
3 篇 inverse problems
3 篇 convergence
3 篇 data mining
3 篇 noise
3 篇 inference algori...
3 篇 computers
3 篇 approximation
3 篇 data structures
3 篇 scheduling
3 篇 parameter estima...

机构

2 篇 school of softwa...
2 篇 univ waterloo ch...
2 篇 interdisciplinar...
2 篇 google inc mount...
2 篇 univ calif berke...
2 篇 univ karlsruhe d...
1 篇 rutgers state un...
1 篇 department of el...
1 篇 university of il...
1 篇 univ toronto ece...
1 篇 dipartimento di ...
1 篇 univ namur preci...
1 篇 budapest univers...
1 篇 dipartimento di ...
1 篇 univ toronto cs ...
1 篇 hdu-itmo joint i...
1 篇 reddit inc. 303 ...
1 篇 tno embedded sys...
1 篇 nvidia knoxville...
1 篇 department of co...

作者

3 篇 van stee rob
3 篇 lin guohui
2 篇 chen zhi-zhong
2 篇 azar y
2 篇 papadimitriou ch...
2 篇 mehta aranyak
2 篇 jansen klaus
2 篇 abdelhamid djeff...
2 篇 daskalakis const...
2 篇 bodyanskiy yevge...
2 篇 lopez-ortiz alej...
2 篇 hougardy stefan
2 篇 dorrigiv reza
2 篇 epstein leah
1 篇 wen jianjun
1 篇 l. miron
1 篇 v. v. veeravalli
1 篇 arulselvan ashwi...
1 篇 angibaud sebasti...
1 篇 yiwei jiang

语言

178 篇 英文
2 篇 中文

检索条件"任意字段=2nd International Workshop on Approximation and Online Algorithms"

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

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

详细简洁

排序：

Slice-based Approximate online Convolutional Dictionary Learning via Convergent Accelerated Inertial Algorithm 2

Slice-based Approximate Online Convolutional Dictionary Lear...

引用

2nd international workshop on Methodologies for Multimedia (Meet4MM)

作者： Zhao, Yanjuan Deng, Zhiyuan Yin, Yi Wang, Jinjia Yanshan Univ Qinhuangdao Hebei Peoples R China Xidian Univ Xian Peoples R China Kunming Shipborne Equipment Res & Test Ctr Kunming Yunnan Peoples R China

ISBN: (纸本)9798400712005

Convolutional dictionary learning (CDL) is a widely used technique in computer vision for accurately capturing local features and texture information in signals. However, most existing CDL methods are based on batch processing, which requires computing the entire dataset at once, resulting in a significant memory requirement that limits further development. To address this issue, researchers have turned to online convolutional dictionary learning (OCDL) in recent years. OCDL inputs data as a stream and stores all historical information in a pair of fixed-size history arrays. This approach avoids the problem of increasing memory requirements with the number of samples. However, current OCDL methods encounter two primary issues when handling big datasets or large dictionaries: the high time complexity of updating history arrays or dictionaries and the challenge of selecting hyperparameters linked to the ADMM algorithm. This paper proposes a slice-based approximate OCDL method called SAOCDL to address the aforementioned problems. The algorithm utilizes a sparse approximation model, where historical data samples are approximated as the convolution sum of the best local dictionary of a single sample and the corresponding local sparse codes. The current sample and a pair of fixed-size history arrays that store this approximation are used to update the best local dictionary. The resulting optimization problem is solved in the spatial domain using the proposed convergent inertial proximal-gradient algorithm, which combines dry friction with Hessian-driven damping. Extensive experiments were conducted on various benchmark datasets, and the results demonstrate that the proposed SAOCDL approach is highly competitive in terms of performance, efficiency, and memory with state-of-the-art OCDL and CDL algorithms.

关键词： Convolutional Sparse Coding online Dictionary Learning Inertial Proximal-gradient Algorithm Local Processing Dry Friction Hessian

来源：评论

学校读者我要写书评

暂无评论

Fast approximation algorithms for Euclidean Minimum Weight Perfect Matching 22nd

Fast Approximation Algorithms for Euclidean Minimum Weight ...

引用

22nd international workshop on approximation and online algorithms, WAOA 2024

作者： Hougardy, Stefan Tammemaa, Karolina Research Institute for Discrete Mathematics and Hausdorff Center for Mathematics University of Bonn Bonn Germany

ISBN: (纸本)9783031813955

We study the problem of finding a Euclidean minimum weight perfect matching for n points in the plane. It is known that a deterministic approximation algorithm for this problems must have at least Ω(nlogn) runtime. We propose such an algorithm for the Euclidean minimum weight perfect matching problem with runtime O(nlogn) and show that it has approximation ratio O(n0.2995). This improves the so far best known approximation ratio of n/2. We also develop an O(nlogn) algorithm for the Euclidean minimum weight perfect matching problem in higher dimensions and show it has approximation ratio O(n0.599) in all fixed dimensions. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Research on Facility Layout of Manufacturing workshop Based on Genetic Algorithm 2

Research on Facility Layout of Manufacturing Workshop Based ...

引用

2nd international Conference on Big Data, Information and Computer Network, BDICN 2023

作者： Jiang, Lu Shanghai Maritime Academy Department of Mechanical and Electrical Engineering Shanghai China

ISBN: (纸本)9798350321364

The production mode of the manufacturing workshop belongs to the typical discrete production, and the workshop layout problem is the basic problem in the manufacturing system, which has a great and continuous impact on the production efficiency of the enterprise. In this paper, based on the field investigation of the production workshop of the manufacturing enterprise, combined with the analysis of the current situation of material handling, through the construction of a multi-objective mathematical model and the use of genetic algorithm to determine the optimal workshop facility layout scheme and material handling route scheme under the actual constraints, through the appropriate optimization of the manufacturing workshop facility layout, the logistics transportation cost is reduced, and the purpose of enterprise cost reduction and efficiency increase is achieved. © 2023 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Improved online Scheduling with Restarts on a Single Machine 22nd

Improved Online Scheduling with Restarts on a Single Mach...

引用

22nd international workshop on approximation and online algorithms, WAOA 2024

作者： Amouzandeh, Aflatoun van Stee, Rob University of Siegen Siegen Germany

ISBN: (纸本)9783031813955

We consider the problem of minimizing the total completion time on a single online machine using restarts. Although restarts can potentially be very beneficial in the context of online scheduling, there has been relatively little research on this topic up until now. We present a very simple online algorithm which is better than 1.4568-competitive. The basic rule of the algorithm is to run jobs in order of increasing size. For possible restarts, the algorithm only considers whether the completion time of an incoming job is more than a factor of 1.4568 higher if we first let the running job finish compared to the case where we start the new job immediately. If this is the case, we interrupt the running job and start running the new job. All other existing or past jobs are ignored for this decision. The analysis of the algorithm has become significantly easier and shorter than for the previous best result which was 3/2. We hope that this result can lead to further research in this interesting topic. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Feedback on Drone Arenas-based Remote international Teaching - DAReTeach 2

Feedback on Drone Arenas-based Remote international Teaching...

引用

2nd IFAC workshop on Aerospace Control Education (WACE)

作者： Stoica, Cristina Bertrand, Sylvain Burlion, Laurent Univ Paris Saclay CNRS Lab Signaux & Syst CentraleSupelec F-91190 Gif Sur Yvette France Univ Paris Saclay ONERA Traitement Informat & Syst F-91123 Palaiseau France Rutgers State Univ Piscataway NJ 08854 USA

This paper presents the lessons learned from a Collaborative online international Learning (COIL) project in Control engineering, involving Rutgers University (USA) and CentraleSupelec (France). Students from both universities collaborated on advanced control design for fleets of aerial and ground vehicles for mission-specific algorithms, encompassing scenarios like search and rescue, building inspections, and artistic drone shows. The project employed active learning methods, with small, tutored groups working on projects. A unique aspect of this COIL involved a 3-step relay structure: 1/ The French students' teams proposed several theoretical case studies involving advanced control techniques for drones formations. 2/ Co-working activities between French and American students were possible during common online tutorship leading to adapt the initial scenarii. 3/ The American students continued the case studies proposed by the French students, completing the work with experiments on real drones. The international component of this COIL set a higher expectation from the students and motivated them to work harder to represent themselves and their respective universities as well. Copyright (C) 2024 The Authors. This is an open access article under the CC BY-NC-nd license (https://***/licenses/by-nc-nd/4.0/)

关键词： Control Education multi-agent systems autonomous systems project-based education teaching and learning experiences Collaborative online international Learning (COIL) on Control

来源：评论

学校读者我要写书评

暂无评论

Tight approximation Bounds on a Simple Algorithm for Minimum Average Search Time in Trees 22nd

Tight Approximation Bounds on a Simple Algorithm for Mini...

引用

22nd international workshop on approximation and online algorithms, WAOA 2024

作者： Høgemo, Svein University of Bergen Bergen Norway

ISBN: (纸本)9783031813955

The graph invariant EPT-sum has cropped up in several unrelated fields in later years: As an objective function for hierarchical clustering, as a more fine-grained version of the classical edge ranking problem, and, specifically when the input is a vertex-weighted tree, as a measure of average/expected search length in a partially ordered set. The EPT-sum of a graph G is defined as the minimum sum of the depth of every leaf in an edge partition tree (EPT), a rooted tree where leaves correspond to vertices in G and internal nodes correspond to edges in G. A simple algorithm that approximates EPT-sum on trees is given by recursively choosing the most balanced edge in the input tree G to build an EPT of G. Due to its fast runtime, this balanced cut algorithm can be used in practice, and has earlier been analysed to give a 1.62-approximation on trees. In this paper, we show that the balanced cut algorithm gives a 1.5-approximation of EPT-sum on trees, which amounts to a tight analysis and answers a question posed by Cicalese et al. in 2014. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

online String Attractors: And Their Relation to the Lempel-Ziv Factorization 22nd

Online String Attractors: And Their Relation to the Lempel...

引用

22nd international workshop on approximation and online algorithms, WAOA 2024

作者： Whittington, Philip ETH Zurich Zurich Switzerland

ISBN: (纸本)9783031813955

In today’s data-centric world, fast and effective compression of data is paramount. To measure success towards the second goal, Kempa and Prezza [STOC2018] introduce the string attractor, a combinatorial object unifying dictionary-based compression. Given a string T∈Σn, a string attractor (k-attractor) is a set of positions Γ⊆[1,n], such that every distinct substring (of length at most k) has at least one occurrence that contains one of the selected positions. String attractors are shown to be approximated by and thus measure the quality of many important dictionary compression algorithms such as Lempel-Ziv 77, the Burrows-Wheeler transform, straight line programs, and macro schemes. In order to handle massive amounts of data, compression often has to be achieved in a streaming fashion. Thus, practically applied compression algorithms, such as Lempel-Ziv 77, have been extensively studied in an online setting. To the best of our knowledge, there has been no such work, and therefore are no theoretical underpinnings, for the string attractor problem. We introduce a natural online variant of both the k-attractor and the string attractor problem. First, we show that the Lempel-Ziv factorization corresponds to the best online algorithm for this problem, resulting in an upper bound of O(log(n)) on the competitive ratio. On the other hand, we consider prefixes of the Fibonacci word, and show that any online algorithm has a cost growing with the length of the prefix, for a matching lower bound of Ω(log(n)). For the online k-attractor problem, we show tight (strict) k-competitiveness. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Factorization

来源：评论

学校读者我要写书评

暂无评论

approximation algorithms for k-Scenario Matching 22nd

Approximation Algorithms for k-Scenario Matching

引用

22nd international workshop on approximation and online algorithms, WAOA 2024

作者： Blom, Danny Hyatt-Denesik, Dylan Amelia, Afrouz Jabal Smeulders, Bart Eindhoven University of Technology Eindhoven5612 AZ Netherlands

ISBN: (纸本)9783031813955

Matching theory is among the most fundamental graph optimization problems. Several different variants of this problem have been introduced and studied. Maximum matching, capacitated matching, and perfect matchings are all well studied examples of problems in matching theory. Here we motivate and study a generalization of the maximum weighted matching problem, so-called k-scenario matching. In k-scenario matching we are given a graph G=(V,E), in which each edge belongs to at least one of the k subsets E1,...,Ek (scenarios), and each scenario is equipped with probability pi for each 1≤i≤k (hence ∑i=1kpi=1). We are provided with budget, some integer B, and our goal is to find a subset E^⊆E of size at most B, that maximizes the expected value of the maximum cardinality matchings on all the possible k scenarios (i.e. ∑i=1kpi|Mi| where Mi is a maximum matching on edges E^∩Ei.) This problem is motivated by applications such as kidney exchange, where compatibility between donors and patients is uncertain. Tests must be performed to ascertain whether two vertices can be matched, but due to the time and cost involved, only a limited number of tests are possible. In this paper we show that this problem is NP-hard even in the simple case where we have two scenarios, and the input graph is both bipartite and sub-cubic. We also study the approximability of this problem in several cases from the positive direction. For the general case of this problem, we find a 2.314-approximation by a natural greedy algorithm. We then present two approximation algorithms for the case where there are two scenarios. When p1=p2=12, our first algorithm achieves a 119-approximation. When p1≠p2, we show that this problem admits a 54-approximation. For the general case of this problem, we find a 2.314-approximation by a natural greedy algorithm. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Budget control

来源：评论

学校读者我要写书评

暂无评论

Improved approximation algorithms for Covering Pliable Set Families and Flexible Graph Connectivity 22nd

Improved Approximation Algorithms for Covering Pliable Set ...

引用

22nd international workshop on approximation and online algorithms, WAOA 2024

作者： Nutov, Zeev The Open University of Israel Ra’anana Israel

ISBN: (纸本)9783031813955

A classic result of Williamson, Goemans, Mihail, and Vazirani [STOC 1993: 708–717] states that the problem of covering an uncrossable set family by a min-cost edge set admits approximation ratio 2, by a primal-dual algorithm with a reverse delete phase. Recently, Bansal, Cheriyan, Grout, and Ibrahimpur [ICALP 2023: 15:1-15:19] showed that this algorithm achieves approximation ratio 16 for a larger class of so called γ-pliable set families, that have much weaker uncrossing properties. In this paper we will improve the approximation ratio to 10. Using this result and other techniques, we also improve approximation ratios for the following two problems related to the Capacitatedk-Edge Connected Spanning Subgraph (Cap-k-ECSS) problem. Near Min-Cuts Cover: Given a graph G0=(V,E0) and an edge set E on V with costs, find a min-cost edge set J⊆E that covers all cuts with at most k-1 edges of the graph G0. We improve the approximation ratio from 16 to 10. We also obtain approximation ratio k-λ0+1+ϵ, where λ0 is the edge connectivity of G0, which is better than ratio 10 when k-λ0≤8.(k, q)-Flexible Graph Connectivity ((k, q)-FGC): Given a graph G=(V,E) with edge costs, a set U⊆E of "unsafe" edges, and integers k, q, find a min-cost subgraph H of G such that every cut of H has at least k safe edges or at least k+q edges. We will show that (k, 1)-FGC admits approximation ratio 3.5+ϵ if k is odd (improving previous ratio 4), that (k, 2)-FGC admits approximation ratio 7+ϵ (improving previous ratio 20), and that (k, 3)-FGC admits approximation ratio 16 for k even (improving previous ratio 22). We also show that for unit costs, (k, q)-FGC admits approximation ratio α+2qk, where α≈1+O(1/k) is an approximation ratio for the Min-Sizek-Edge-Connected Spanning Subgraph problem. Near Min-Cuts Cover: Given a graph G0=(V,E0) and an edge set E on V with costs, find a min-cost edge set J⊆E that covers all cuts with at most k-1 edges of the graph G0. We improve the approximation ratio from 16

关键词： approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

15th international workshop on Frontiers in Algorithmics, FAW 2021, held in conjunction with 2nd international Joint Conference on Theoretical Computer Science, IJTCS-FAW 2021

15th International Workshop on Frontiers in Algorithmics, FA...

引用

15th international workshop on Frontiers in Algorithmics, FAW 2021, held in conjunction with 2nd international Joint Conference on Theoretical Computer Science, IJTCS-FAW 2021

ISBN: (纸本)9783030970987

The proceedings contain 5 papers. The special focus in this conference is on Frontiers in Algorithmics. The topics include: Faster algorithms for k-SUBSETSUM and Variations;hardness and algorithms for Electoral Manipulation Under Media Influence;improved approximation algorithms for Multiprocessor Scheduling with Testing.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：