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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,582 篇 会议
744 篇 期刊文献
7 篇 学位论文
2 册 图书

馆藏范围

3,335 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,375 篇 工学
- 698 篇 电气工程
- 695 篇 计算机科学与技术...
- 336 篇 信息与通信工程
- 182 篇 控制科学与工程
- 127 篇 软件工程
- 97 篇 仪器科学与技术
- 61 篇 电子科学与技术（可...
- 50 篇 机械工程
- 41 篇 交通运输工程
- 16 篇 石油与天然气工程
- 10 篇 生物医学工程（可授...
- 9 篇 动力工程及工程热...
- 8 篇 网络空间安全
- 7 篇 土木工程
- 6 篇 光学工程
387 篇 理学
- 247 篇 数学
- 64 篇 系统科学
- 54 篇 物理学
- 21 篇 生物学
- 18 篇 统计学（可授理学、...
- 8 篇 化学
- 5 篇 地球物理学
144 篇 管理学
- 139 篇 管理科学与工程(可...
- 8 篇 工商管理
28 篇 医学
- 20 篇 临床医学
- 7 篇 基础医学(可授医学...
- 5 篇 特种医学
24 篇 文学
- 23 篇 新闻传播学
17 篇 经济学
- 12 篇 应用经济学
- 6 篇 理论经济学
6 篇 法学
6 篇 教育学
3 篇 农学
2 篇 军事学
2 篇 艺术学

主题

3,335 篇 greedy algorithm...
353 篇 approximation al...
318 篇 algorithm design...
311 篇 optimization
286 篇 heuristic algori...
216 篇 computer science
200 篇 resource managem...
178 篇 computational mo...
172 篇 costs
154 篇 routing
147 篇 genetic algorith...
131 篇 linear programmi...
115 篇 clustering algor...
110 篇 wireless sensor ...
103 篇 matching pursuit...
102 篇 computational co...
99 篇 compressed sensi...
97 篇 bandwidth
95 篇 vectors
94 篇 conferences

机构

10 篇 univ s carolina ...
8 篇 univ texas austi...
8 篇 harbin institute...
7 篇 univ waterloo de...
7 篇 univ athens dept...
7 篇 univ penn dept e...
6 篇 univ calif santa...
6 篇 beijing universi...
5 篇 national mobile ...
5 篇 texas a&m univ d...
5 篇 school of comput...
5 篇 univ maryland de...
5 篇 school of comput...
5 篇 department of co...
5 篇 school of comput...
5 篇 school of inform...
5 篇 stanford univ de...
5 篇 temple univ dept...
4 篇 school of comput...
4 篇 ohio state univ ...

作者

9 篇 borodin allan
8 篇 jun li
8 篇 wei wang
7 篇 yu wang
7 篇 theodoridis serg...
7 篇 nonomura taku
6 篇 xi chen
6 篇 saito yuji
6 篇 vandergheynst pi...
6 篇 yamada keigo
6 篇 grimsman david
6 篇 marden jason r.
6 篇 chatterjee saika...
6 篇 jie wu
6 篇 haasdonk bernard
6 篇 moshkov mikhail
6 篇 yang liu
6 篇 nagata takayuki
6 篇 wu weili
5 篇 sundaram shreyas

语言

3,280 篇 英文
40 篇 其他
14 篇 中文
2 篇 俄文
1 篇 德文
1 篇 法文

检索条件"主题词=greedy algorithms"

共 3335 条记录，以下是3311-3320 订阅

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

详细简洁

排序：

General Optimization Strategies for Refining the In-Parameter-Order Algorithm

General Optimization Strategies for Refining the In-Paramete...

引用

International Conference on Quality Software

作者： Shiwei Gao Jianghua Lv Binglei Du Yaruo Jiang Shilong Ma State Key Laboratory of Software Development Environment Beihang University Beijing China

ISBN: (纸本)9781479971992

In-Parameter-Order (IPO) algorithm is an effective strategy of combinatorial testing. And several variants of the algorithm have been developed for reducing the runtime and size of test cases or for dealing with certain problems in test case generation, such as IPOG, IPOG-F and IPOG-F2. In this paper, the general optimization strategies, which can be applied to these variants of the algorithm, are proposed to make each value of all parameters more evenly distributed in the test cases. The proposed optimization strategies mainly focus on choosing values for the extension to an additional parameter during the horizontal growth of the algorithm and filling values for don't care positions. Experimental results show that the proposed optimization strategies are effective in reducing runtime and producing smaller size of test suites with the increase of the domain size.

关键词： Testing Optimization greedy algorithms Algorithm design and analysis Software algorithms Software Electronic mail

来源：评论

学校读者我要写书评

暂无评论

An algorithm for optimal placement of sensor elements

An algorithm for optimal placement of sensor elements

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Y. Lee S.U. Pillai Department of Electrical Engineering and Computer Science Polytechnic University Brooklyn NY USA

The problem of finding the optimal minimum-redundancy integer locations for an array of given sensors that span a prescribed distance N, such that any missing integer i (0 >

关键词： Sensor arrays Direction of arrival estimation greedy algorithms Radar applications Spaceborne radar Sonar applications Astronomy Costs Contracts Sensor phenomena and characterization

来源：评论

学校读者我要写书评

暂无评论

Binary Linear Network Codes

Binary Linear Network Codes

引用

IEEE (first ITW conference of the year) Information Theory Workshop (ITW)

作者： Hsiao-feng Lu Department of Communications Engineering National Chung Cheng University Chiayi Taiwan

Network coding over a delay-free acyclic communication network with single source is considered in this paper. The network is modeled as a directed acyclic graph G where each edge in G is assumed to have unit link capacity. Previous works on network coding require a sufficiently large field such that the network has either a linear multicast, a linear broadcast, or a linear dispersion solution. For certain graphs, it is also known that linear network codes over a field of smaller size might not exist. In this paper, we propose a linear network code with memory and show that for any directed acyclic network with single source, there always exists a binary linear dispersion network code. Such code can be explicitly constructed and requires only the binary field for realization. Thus, this approach would dramatically reduce the hardware complexity for code implementation. Also contained in this paper is an explicit construction of binary linear broadcast network code for any directed acyclic networks.

关键词： Network coding Broadcasting Encoding Communication networks Kernel Hardware Vectors greedy algorithms Tellurium

来源：评论

学校读者我要写书评

暂无评论

Tests for decision tables with many-valued decisions — Comparative study

Tests for decision tables with many-valued decisions — Comp...

引用

Federated Conference on Computer Science and Information Systems (FedCSIS)

作者： Mohammad Azad Igor Chikalov Mikhail Moshkov Beata Zielosko King Abdullah University of Science and Technology Thuwal SA

The paper is devoted to the study of a greedy algorithm for construction of approximate tests (super-reducts). This algorithm is applicable to decision tables with many-valued decisions where each row is labeled with a set of decisions. For a given row, we should find a decision from the set attached to this row. The idea of algorithm is connected with so-called boundary subtables. After constructing a test we use algorithm which tries to remove attributes from a test and obtain a reduct. We present experimental results connected with the cardinality of tests and reducts for randomly generated tables and data sets from UCI Machine Learning Repository which were converted to decision tables with many-valued decisions. To make some comparative study we presents also experimental results for greedy algorithm which constructs a test based on generalized decision approach.

关键词： greedy algorithms Approximation algorithms Polynomials Computer science Educational institutions Machine learning algorithms Machine learning

来源：评论

学校读者我要写书评

暂无评论

An object-oriented framework for local search heuristics

An object-oriented framework for local search heuristics

引用

Technology of Object-Oriented Languages and Systems (TOOLS)

作者： A.A. Andreatta S.E.R. Carvalho C.C. Ribeiro Department of Computer Science Catholic University of Rio de Janeiro Sao Vicente Rio de Janeiro Brazil

In the study of heuristics for combinatorial problems, it is often important to develop and compare different algorithms, strategies, and parameters for the same problem. This comparison is often biased not only by different implementation languages, but also by different architectures. This paper proposes a framework described using design patterns, modeling different aspects involved in local search heuristics, such as algorithms for the construction of initial solutions, methods for neighborhood generation, and movement selection criteria. Using this framework we fix a basic architecture and thus increase our ability to construct and compare heuristics.

关键词： Search methods Heuristic algorithms Optimization methods Costs Iterative algorithms Computer science Electronic mail Algorithm design and analysis Object oriented modeling greedy algorithms

来源：评论

学校读者我要写书评

暂无评论

BCA Channel Routing to Minimize Wirelength for Generalized Channel Problem

BCA Channel Routing to Minimize Wirelength for Generalized C...

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： Zezhong Wang Masayuki Shimoda Atsushi Takahashi Tokyo Institute of Technology Tokyo Japan

ISBN: (数字)9798350330991

ISBN: (纸本)9798350331004

Routing has a crucial impact on chip design [1]. In this paper, a BCA (Below-Cross-Above) routing, especially for critical routing layers, is proposed. It is assumed that horizontal routing capacity is tight and that all pins of a net need to be connected by a Single Trunk Steiner Tree. Our proposed algorithm is a greedy algorithm based on a well-known Left-Edge algorithm. The track assignment of nets is determined iteratively by taking net priority into account to reduce the vertical length while keeping the required number of tracks as small as possible. In experiments, it is confirmed that the vertical wirelength is reduced by around 40% compared with the track assignment by Left Edge algorithm.

关键词： Steiner trees greedy algorithms Circuits and systems Routing Minimization Pins Chip scale packaging

来源：评论

学校读者我要写书评

暂无评论

Fast Optimal Resource Allocation for Scalable Video Multicast in Broadband Wireless Networks

Fast Optimal Resource Allocation for Scalable Video Multicas...

引用

IEEE International Conference on Communications (ICC)

作者： P. Li H. Zhang B. Zhao S. Rangarajan Department of Computer Science and Technology University of Science and Technology Hefei Anhui China NEC Laboratories of America Inc. Princeton NJ USA State Key Laboratory of Networking and Switching Technology Beijing China

Scalable video coding (SVC) and Adaptive Modulation and Coding (AMC) are two key techniques for video multicast in broadband wireless networks. They can improve the system performance by enhancing the wireless resource allocation schemes and assigning appropriate modulation and coding schemes (MCS) to different layers of scalable video sequences. We formulate the problem as maximizing the total system utility subject to the total resource constraint, where the utility of each user is a generic non-negative, non-decreasing function of received rate. We then propose a fast intra-session MCS assignment algorithm based on dynamic programming. This algorithm can be integrated with an existing inter-session resource allocation algorithm and applied to multi-session scenarios. Simulation results show that our algorithm achieves significant improvement on the video quality over a naive algorithm and an adapted greedy algorithm, and greatly reduces the running time in both single-session and multi-session scenarios compared to a former optimal algorithm.

关键词： Resource management Wireless networks Modulation coding Video coding Static VAr compensators System performance Video sequences Heuristic algorithms Dynamic programming greedy algorithms

来源：评论

学校读者我要写书评

暂无评论

Specification coverage aided test selection

Specification coverage aided test selection

引用

International Conference on Application of Concurrency to System Design

作者： T. Pyhala K. Heljanko Laboratory for Theoretical Computer Science Helsinki University of Technology Finland

Here, we consider test selection strategies in formal conformance testing. As the testing conformance relation we use the ioco relation, and extend the previously presented on-the-fly test generation algorithms for ioco to include test selection heuristic based on a specification coverage metric. The proposed method combines a greedy test selection with randomization to guarantee completeness. As a novel implementation technique we employ bounded model checking for lookahead in greedy test selection.

关键词： Laboratories Computer science Protocols Software testing Data communication Computer bugs Java Event detection System testing greedy algorithms

来源：评论

学校读者我要写书评

暂无评论

Minimum Cost Hybrid Node Protection in NFV

Minimum Cost Hybrid Node Protection in NFV

引用

International Conference on Computer and Communications (ICCC)

作者： Chengzong Peng Danyang Zheng Xiaojun Cao Georgia State University USA School of Electronic and Information Engineering Soochow University China

ISBN: (纸本)9781665409513

In network function virtualization (NFV), the customer’s service requests are delivered by going through a set of deployed service functions (SFs). To accommodate customer’s requests, service providers have to install the required SFs onto a physical network (PN) and route the traffic through the installed SFs to form a traffic forwarding path called the service function path (SFP). Any failures of physical nodes or SF instances can significantly impact the service delivery. In the literature, existing work has focused on how to protect the PN from physical node failures. Few research attention has been paid to efficiently protecting the network while jointly taking physical and virtual node failures into consideration. In this work, we investigate a novel minimum cost hybrid node protection (MC-HOP) problem, which is proved to be an NP-hard problem. We propose an efficient algorithm called minimum cost pairwise node assistance (NOTION) to optimize the MC-HOP problem with latency requirements. Extensive simulations and analysis show that the proposed scheme significantly outperforms the algorithms that are directly extended from the existing work.

关键词： greedy algorithms Analytical models Costs NP-hard problem Computer network reliability Mathematical models Network function virtualization

来源：评论

学校读者我要写书评

暂无评论

A Novel Track Segment Association Method Using Contextual Contrasting

A Novel Track Segment Association Method Using Contextual Co...

引用

IEEE International Conference on Unmanned Systems (ICUS)

作者： Ziyang Li Wen Jiang School of Electronics and Information Northwestern Polytechnical University Xi'an China

ISBN: (数字)9798350384185

ISBN: (纸本)9798350384192

During target tracking, interruptions often occur due to target maneuvers, missed detections, and long sampling intervals. These interruptions can significantly hinder information fusion and situational awareness. Traditional methods, which rely on hypothetical models and estimation theories to measure similarity between track segments to be associated, have several drawbacks such as unreasonable hypotheses, unsuitable models, and uncertain thresholds. To address these issues, data-driven methods with strong learning ability, like deep learning methods, are gradually used. However, existing data-driven methods are difficult to generalize to scenarios with long interruption interval condition. In order to tackle this problem, a novel track segment association method using contextual contrasting (TSA-CC) is proposed. TSA-CC consists of three key components: (i) separation of track segment into subseries-level patches, which serve as input tokens for the Siamese Transformer encoders; (ii) introduction of learnable time-related embeddings to distinguish temporal distance between sampled segments; (iii) contextual contrasting module used for learning discriminative representations. TSA-CC then selects the track segments corresponding to the nearest vectors in the feature space as associated pairs. Experiments on a real-world AIS dataset demonstrate the effectiveness of TSA-CC.

关键词： greedy algorithms Target tracking Correlation Semantics Measurement uncertainty Transformers Feature extraction Vectors Artificial intelligence Testing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共334页 << < 325 326 327 328 329 330 331 332 333 334 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：