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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,352 篇 期刊文献
911 篇 会议
19 篇 学位论文
1 册 图书

馆藏范围

2,283 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,757 篇 工学
- 991 篇 计算机科学与技术...
- 602 篇 电气工程
- 359 篇 信息与通信工程
- 208 篇 软件工程
- 166 篇 控制科学与工程
- 106 篇 电子科学与技术（可...
- 102 篇 机械工程
- 83 篇 仪器科学与技术
- 50 篇 航空宇航科学与技...
- 49 篇 交通运输工程
- 48 篇 石油与天然气工程
- 31 篇 力学（可授工学、理...
- 26 篇 材料科学与工程（可...
- 24 篇 土木工程
- 21 篇 动力工程及工程热...
- 21 篇 环境科学与工程（可...
- 17 篇 测绘科学与技术
- 15 篇 网络空间安全
793 篇 理学
- 576 篇 数学
- 95 篇 物理学
- 58 篇 生物学
- 47 篇 系统科学
- 36 篇 统计学（可授理学、...
- 25 篇 化学
- 17 篇 地球物理学
306 篇 管理学
- 293 篇 管理科学与工程(可...
- 36 篇 工商管理
78 篇 医学
- 45 篇 临床医学
60 篇 经济学
- 46 篇 应用经济学
- 15 篇 理论经济学
20 篇 农学
8 篇 法学
5 篇 教育学
5 篇 军事学
4 篇 文学
1 篇 艺术学

主题

2,283 篇 greedy algorithm
100 篇 greedy algorithm...
68 篇 optimization
64 篇 genetic algorith...
63 篇 compressed sensi...
46 篇 algorithms
43 篇 influence maximi...
35 篇 dynamic programm...
34 篇 social networks
34 篇 scheduling
33 篇 approximation al...
32 篇 approximation al...
31 篇 greedy method
30 篇 matroid
26 篇 combinatorial op...
23 篇 compressive sens...
23 篇 linear programmi...
20 篇 submodular funct...
20 篇 wireless sensor ...
20 篇 integer programm...

机构

9 篇 univ s carolina ...
8 篇 univ autonoma ma...
8 篇 univ texas dalla...
7 篇 univ chinese aca...
6 篇 nanyang technol ...
6 篇 moscow mv lomono...
5 篇 brown univ div a...
5 篇 yerevan state un...
5 篇 univ s carolina ...
5 篇 mit cambridge ma...
5 篇 univ sci & techn...
4 篇 univ sci & techn...
4 篇 nanyang technol ...
4 篇 new jersey inst ...
4 篇 univ texas austi...
4 篇 ohio state univ ...
4 篇 univ ulm inst op...
4 篇 georgia state un...
4 篇 univ int busines...
4 篇 rutgers state un...

作者

9 篇 borowiecki piotr
9 篇 qian tao
8 篇 zielosko beata
8 篇 wang wei
8 篇 moshkov mikhail
7 篇 zhang zhao
7 篇 michel volker
7 篇 wang yu
7 篇 sawada joe
7 篇 faigle u
6 篇 temlyakov vn
6 篇 rautenbach diete...
6 篇 tang yuan yan
6 篇 chen yanlai
6 篇 chen peng
6 篇 wu weili
5 篇 saito yuji
5 篇 zhang xiaoyan
5 篇 zhang tong
5 篇 yamada keigo

语言

2,124 篇 英文
125 篇 其他
27 篇 中文
3 篇 法文
2 篇 德文
1 篇 葡萄牙文

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

共 2283 条记录，以下是181-190 订阅

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

详细简洁

排序：

greedyAgent: Crafting Efficient Agents for Meta-learning from Learning Curves via greedy algorithm Selection 20th

GreedyAgent: Crafting Efficient Agents for Meta-learning fro...

引用

20th International Conference on Intelligent Computing (ICIC)

作者： He, Jinyu Song, Xiaowei Yan, Xiaohan Wang, Nan Miao, Yuqi Jiang, Zijian Chao, Fei Zhang, Yan Zhang, Shengchuan Ji, Rongrong Xiamen Univ Sch Informat Xiamen 361005 Peoples R China Tongji Univ Coll Elect & Informat Engn Shanghai 201804 Peoples R China

ISBN: (纸本)9789819756629;9789819756636

With the rapid development of artificial intelligence and machine learning technologies, Automated Machine Learning (AutoML) has become a hot research area in recent years. Meta-learning plays an increasingly important role in AutoML. Akey sub-problem-meta-learning from learning curves is an immature but gradually gaining attention are awithin the field ofmeta-learning. For instance, in MetaLC, the organizers designed a competition on meta-learning from learning curves, whose goal is to achieve the highest all-time performance, based on the algorithm's selection strategy learned by past learning curves. This competition aims to simulate the meta-learning process in an environment like reinforcement learning, where the strategies provided by the participants act as agents interacting with the environment. We innovatively propose a training strategy for agents called greedyAgent, based on an approximate greedy algorithm. After reducing the problem of meta-learning from learning curves to a 0-1 knapsack problem, we proved that our greedy method could replace the dynamic programming method to find an approximate optimal solution. In both the development phase and the final evaluation phase, our method achieved state-of-the-art in test results. We compared five baseline methods and selected representative cases for detailed analysis. The competition's second round has been accepted by the first AutoML Conference. Besides, our solution ranked 1st among the 14 methods participating in the competition. The code of our method has been released: https://***/dragonbra/MetaLC-2nd-Round.

关键词： AutoML Meta-learning Learning curves greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

Routing Analysis in The Emergency Call Application By Using Hill Climbing and greedy algorithm

Routing Analysis in The Emergency Call Application By Using ...

引用

IEEE Asia Pacific Conference on Wireless and Mobile (APWiMob)

作者： Syathirah, Andi Sitti Setianingsih, Casi Kusuma, Purba Daru Telkom Univ Sch Elect Engn Bandung Indonesia

ISBN: (纸本)9781665474863

Emergency calls in Indonesia are still implementing satellite call technology to call emergency agencies. Indonesia already has a universal emergency number, but its implementation is still not evenly distributed in all cities/districts, where the emergency number is 112. Most Indonesians rarely know this number because the information from this number is less published, and people tend to use the Internet more than conventional calls. The author can build a calling application that combines with Google Maps to provide an image display from a digital map by utilizing an internet-based application. The application automatically routes the caller's location to the agency's location that is called directly. Based on the test results, Hill Climbing and greedy routing algorithms can be implemented properly by using SAW (Simple Additive Weighting) weights of 30% distance and 70% duration, which has a total range value between nodes is 0.022. The greedy algorithm gives the best results based on the average response time is 0.912, while Hill Climbing algorithm is 1.59. As a result, the best route in this research comparing Hill Climbing and the greedy algorithm is the greedy algorithm.

关键词： Best Route Hill Climbing algorithm greedy algorithm Google Maps

来源：评论

学校读者我要写书评

暂无评论

A greedy algorithm for convex geometries

A greedy algorithm for convex geometries

引用

5th Japan/Korea Joint Workshop on algorithms and Computation

作者： Kashiwabara, K Okamoto, Y Univ Tokyo Grad Sch Arts & Sci Dept Syst Sci Tokyo 1538902 Japan

Convex geometries are closure spaces which satisfy anti-exchange property, and they are known as dual of antimatroids. We consider functions defined on the sets of the extreme points of a convex geometry. Faigle-Kern (Math. Programming 72 (1996) 195-206) presented a greedy algorithm to linear programming problems for shellings of posets, and Kruger (Discrete Appl. Math. 99 (2002) 125-148) introduced b-submodular functions and proved that Faigle-Kern's algorithm works for shellings of posets if and only if the given set function is b-submodular. We extend their results to all classes of convex geometries, that is, we prove that the same algorithm works for all convex geometries if and only if the given set function on the extreme sets is submodular in our sense. (C) 2003 Elsevier B.V. All rights reserved.

关键词： antimatroid convex geometry extreme set greedy algorithm submodularity

来源：评论

学校读者我要写书评

暂无评论

A Communication Contention-Aware greedy algorithm for Scheduling Join Task Graphs

A Communication Contention-Aware Greedy Algorithm for Schedu...

引用

World Automation Congress (WAC)

作者： Zhang, Jianjun Huang, Dengbin Qu, Yong Naval Univ Engn Coll Sci Wuhan 430033 Hubei Province Peoples R China

ISBN: (纸本)9781467344975

Aiming at the problem that many previous scheduling algorithms for task graphs always ignore the communication contention, this paper presents a communication contention-aware greedy scheduling algorithm, named CCAG_J, for scheduling join task graphs, which can improve the scheduling performance by serializing the communication edges to integrate the communication awareness into task scheduling. Experimental evaluation validated that the CCAG_J algorithm produces superior results than other compared algorithms in terms of schedule length, number of used processors, speedup and efficiency.

关键词： Task scheduling Join task graph greedy algorithm Communication contention Critical task

来源：评论

学校读者我要写书评

暂无评论

The Research of Test Case Generation and Its Optimization Methods Based on Orthogonal Test Method and greedy algorithm

The Research of Test Case Generation and Its Optimization Me...

引用

International Conference on Intelligent Human-Machine Systems and Cybernetics

作者： Tian, Pei Leng, Huaijing Yang, Shaohua Wang, Yufang Commun Univ China Informat Engn Sch Beijing Peoples R China

ISBN: (纸本)9780769537528

In software testing, the large number of test cases affected the progress of software testing seriously. In order to generate effective test cases with high-quality data. In this paper, a method which is about the test case generation and its optimization methods based on orthogonal test method and greedy algorithm is presented. First of all, the basic concepts, main features and the steps of generating test cases of the orthogonal test method are introduced;then, the optimal method of generated test cases using the greedy algorithm is gave;Finally, the test cases generation and its optimization are explained by using orthogonal test method and greedy algorithm, and which is applied to practical engineering tests.

关键词： software testing test case orthogonal test method greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

A Weight-based greedy algorithm for Target Coverage Problem in Wireless Sensor networks 1

A Weight-based Greedy Algorithm for Target Coverage Problem ...

引用

1st International Conference on Computer, Communications, and Control Technology (I4CT)

作者： Diop, Babacar Diongue, Dame Thiare, Ousmane Gaston Berger Univ BP 234 St Louis Senegal

ISBN: (纸本)9781479945559

Recent improvements in affordable and efficient integrated electronic devices have enabled a wide range of applications in the estate of wireless sensor networks. An important issue addressed in wireless sensor networks is the coverage problem. This latter is centered on a fundamental question: how well do the sensors observe the physical space? A major challenge in coverage problem is how to maximize the lifetime of the network while ensuring coverage of a set of targets. To achieve this, the usual process, consists on scheduling sensors activity, which enables energy dissipation control. Scheduling process goes by activating sensors by round such that in each round, only one subset of sensors that satisfies the coverage requirement is activated, while all other sensors are in a low energy mode and will be activated later. In this paper, we propose a weight-based greedy algorithm (WGA) which organizes sensors in multiple subsets. Our objective is to partition an initial set of sensors into a maximum possible number of sensors set covers (SSCs), which can completely monitor targets in a region of interest. Performance evaluation of WGA have proven its efficiency over some well-known algorithms proposed in the literature, in term of computed set covers.

关键词： Wireless Sensor Network Target coverage Sensor Set Cover greedy algorithm

来源：评论

学校读者我要写书评

暂无评论

A probabilistic greedy algorithm with forced assignment and compression for fast frequency assignment in cellular network 13

A probabilistic greedy algorithm with forced assignment and ...

引用

13th IEEE International Symposium on Network Computing and Applications (NCA)

作者： Ghosal, Subhankar Ghosh, Sasthi C. Indian Stat Inst Adv Comp & Microelect Unit Kolkata 700108 India

ISBN: (纸本)9781479953936

This paper presents a probabilistic greedy algorithm for solving the channel assignment problem (CAP) in cellular networks. We took each call as a vertex of a complete edge weighed graph, termed as CAP graph, where an edge weight represents the minimum frequency separation needed between the calls represented by the terminal vertices of that edge. Our objective is to assign non-negative integers representing colors or frequencies to the vertices of the CAP graph such that the required span (maximum frequency - minimum frequency) is minimized while satisfying the frequency separation constraints represented by the edge weights. We begin with a probabilistic ordering of the vertices and apply frequency exhaustive strategy to color them. During the coloring, when color of a vertex exceeds the maximum color of previously allocated vertices, we apply a forced assignment phase to reduce the so far obtained span. Finally we propose an iterative compression phase to further reduce the span obtained from applying the frequency exhaustive strategy with forced assignment phase. The proposed polynomial time algorithm is then applied over the well-known benchmark instances and the obtained spans are measured. The obtained results show that the proposed algorithm performs better that the existing assignment strategies with respect to deviation from optimality and computation time. The time taken by our algorithm is less than 1.77 seconds (HP Z400 Workstation) even for the most difficult benchmark instances and thus is very much suitable where fast channel assignment is of primary importance while a marginal deviation from optimality may be tolerated.

关键词： Basestations Benchmarktesting Color greedyalgorithms Interference Probabilisticlogic Vectors Color frequency assignment Cellular networks vertex head greedy algorithm minimum frequency frequency separation optimality Forced interference Hats common agricultural policy SERPINB6 gene CAPS Cap

来源：评论

学校读者我要写书评

暂无评论

The research of greedy algorithm On Cognitive Radio 4

The research of Greedy Algorithm On Cognitive Radio

引用

4th International Conference on Instrumentation and Measurement, Computer, Communication and Control (IMCCC)

作者： Liu Wen Li Xin Li Hanchao An Yuanyuan HUST Coll Measure Control Technol & Commun Engn Harbin 150080 Peoples R China

ISBN: (纸本)9781479965755

greedy algorithm for which situation of users' number more than free channel's number gives tacit consent to each user could receive one sub-channel. This is very different from virtual situation. For this reason, this text has improved the greedy algorithm. In allocation progress of spectrum resources, the conflict of secondary users and authorized users on time domain has to be considered, and also the competition between secondary users on frequency domain. On time domain, utilizing probability to describe the influence which conflict bring to systematic total benefit. On frequency domain, using decreased number of channels to characterize the competitive relationship between each secondary user. The improved greedy algorithm has better systematic total throughput and property of competitive auction system transmittal data quantity for each time. It is able to tackle the problem of unreasonable allocation for resource management. And then, give secondary users more effective and more possibility of spectrum access, improved the situation of spectrum resources deficiency.

关键词： greedy algorithm Spectrum allocation Time domain Frequency domain

来源：评论

学校读者我要写书评

暂无评论

A simple greedy algorithm for finding functional relations: efficient implementation and average case analysis

A simple greedy algorithm for finding functional relations: ...

引用

3rd International Conference on Discovery Science

作者： Akutsu, T Miyano, S Kuhara, S Univ Tokyo Inst Med Sci Ctr Human Genome Minato Ku Tokyo 1088639 Japan Kyushu Univ Grad Sch Genet Resources Technol Higashi Ku Fukuoka 8128581 Japan

Inferring functional relations from relational databases is important for the discovery of scientific knowledge because many experimental data are represented in the form of tables and many rules are represented in the form of functions. A simple greedy algorithm has been known as an approximation algorithm for this problem. This paper presents an efficient implementation of the algorithm. This paper also shows that the algorithm can identify an exact solution for simple functions if input data for each function are generated uniformly at random and the size of the domain is bounded by a constant. Results of computational experiments using artificially generated data are presented to verify the approach. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： functional dependencies set cover greedy algorithm average case analysis knowledge discovery

来源：评论

学校读者我要写书评

暂无评论

A greedy algorithm for Decentralized Bayesian Detection with Feedback 37

A Greedy Algorithm for Decentralized Bayesian Detection with...

引用

37th IEEE Sarnoff Symposium (Sarnoff)

作者： Dong, Weiqiang Kam, Moshe New Jersey Inst Technol Dept Elect & Comp Engn Newark NJ 07102 USA

ISBN: (纸本)9781509015405

We consider a decentralized binary detection architecture comprised of n local detectors (LDs) communicating their decisions to a Data Fusion Center (DFC). Each local detector (LD) declares preference for one of two hypotheses (H-0 or H-1) and transmits it to the DFC. The decision of the k(th) LD at time step t is u(k)(t) .The DFC develops a global preference u(0)(t) for one of hypotheses based on the vector of local decisions U-t while minimizing a Bayesian cost. The input to the k(th) LD at time step t is the observation u(k)(t) collected from the surveyed environment, and the previous global decision u(0)(t-1) Alhakeem and Varshney developed a person-by-person optimal (PBPO) solution to this problem, namely a PBPO procedure to calculate the global fusion rule and the local decision rules. However, their solution requires that at each time step 2(n) fusion rule equations and 2n local threshold equations be solved simultaneously. In this paper we suggest a suboptimal solution to the problem, based on independent local minimizations of similar Bayesian cost by each LD and by the DFC. To assess the cost of decentralization, the performance of this solution is compared to that of an architecture that processes all observations in one central location.

关键词： Distributed Detection Decentralized Detection Detection Fusion with Feedback greedy algorithm Data Fusion Decision Fusion

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共229页 << < 15 16 17 18 19 20 21 22 23 24 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：