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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

38 篇 会议
36 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

63 篇 工学
- 43 篇 计算机科学与技术...
- 26 篇 电气工程
- 22 篇 控制科学与工程
- 14 篇 信息与通信工程
- 7 篇 软件工程
- 2 篇 航空宇航科学与技...
- 1 篇 电子科学与技术（可...
22 篇 理学
- 16 篇 数学
- 7 篇 系统科学
- 3 篇 统计学（可授理学、...
- 1 篇 物理学
11 篇 管理学
- 11 篇 管理科学与工程(可...
2 篇 经济学
- 1 篇 理论经济学
- 1 篇 应用经济学
1 篇 文学
- 1 篇 新闻传播学
1 篇 医学
- 1 篇 临床医学

主题

75 篇 randomised algor...
9 篇 computational co...
9 篇 probability
8 篇 iterative method...
6 篇 randomized algor...
6 篇 optimisation
6 篇 randomized algor...
4 篇 convex programmi...
4 篇 approximation th...
4 篇 resource allocat...
4 篇 search problems
4 篇 random processes
4 篇 stochastic proce...
4 篇 deterministic al...
3 篇 approximation al...
3 篇 static-output-fe...
3 篇 markov processes
3 篇 gradient methods
3 篇 cloud computing
3 篇 linear systems

机构

2 篇 simon fraser uni...
1 篇 johns hopkins un...
1 篇 univ sci & techn...
1 篇 ctr univ morsli ...
1 篇 menoufia univ de...
1 篇 beijing inst tec...
1 篇 politecn milan d...
1 篇 katholieke univ ...
1 篇 jerusalem coll t...
1 篇 univ warsaw inst...
1 篇 univ liege dept ...
1 篇 tech univ monche...
1 篇 univ washington ...
1 篇 univ london impe...
1 篇 univ padua dept ...
1 篇 jerusalem coll t...
1 篇 russian acad sci...
1 篇 univ michigan de...
1 篇 univ oberta cata...
1 篇 countinglab ltd ...

作者

3 篇 peretz y.
2 篇 goldberg leslie ...
2 篇 nuyens dirk
2 篇 berenbrink petra
2 篇 wilkes laurence
1 篇 starobinski davi...
1 篇 bhawani sankar b...
1 篇 ge quanbo
1 篇 capello elisa
1 篇 dumitriu ioana
1 篇 avrachenkov k.
1 篇 stephan mertens
1 篇 prokhorenkova l....
1 篇 khanafer ali
1 篇 starikovskaya ta...
1 篇 larcheveque hube...
1 篇 fotakis dimitris
1 篇 ourbih-tari megd...
1 篇 nazin alexander
1 篇 schrijvers okke

语言

71 篇 英文
2 篇 其他
2 篇 中文

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

共 75 条记录，以下是61-70 订阅

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

详细简洁

排序：

Generation of Communication Schedules for Multi-Mode Distributed Real-Time Applications

Generation of Communication Schedules for Multi-Mode Distrib...

引用

Design, Automation and Test in Europe Conference and Exhibition (DATE)

作者： Azim, Akramul Carvajal, Gonzalo Pellizzoni, Rodolfo Fischmeister, Sebastian Univ Waterloo Dept Elect & Comp Engn Waterloo ON N2L 3G1 Canada

ISBN: (纸本)9783981537024

A key problem in designing multi-mode real-time systems is the generation of schedules to reduce the complexities of transforming the model semantics to code. Moreover, distributed multi-mode applications are prone to suffer from delays incurred during mode changes. We therefore aim to generate communication schedules that have low average mode-change delay for multi-mode real-time distributed applications. In this paper, we use optimization constraints associated to timing requirements to generate state-based schedules for multi-mode communication systems, and illustrate the workflow for generating schedules from specifications through a real-time video monitoring case-study. Our experiments in the case-study demonstrate that schedules generated using the proposed method reduce the average mode-change delay in relation to a randomized algorithm and the well-known EDF scheduling algorithm.

关键词： bandwidth allocation delays processor scheduling randomised algorithms real-time systems video communication EDF scheduling algorithm average mode-change delay communication schedule generation earliest-deadline-first mode-change delay model semantics multimode communication systems multimode distributed real-time applications optimization constraints randomized algorithm real-time video monitoring state-based schedules Bandwidth Delays Real-time systems Schedules Streaming media Time division multiple access

来源：评论

学校读者我要写书评

暂无评论

Searching for a One-Dimensional Random Walker: Randomized Strategy with Energy Budget

Searching for a One-Dimensional Random Walker: Randomized St...

引用

IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)

作者： Renzaglia, Alessandro Noori, Narges Isler, Volkan Univ Minnesota Dept Comp Sci & Engn Minneapolis MN 55455 USA

ISBN: (纸本)9781467363587

In this paper we study the problem of designing search strategies to find a target whose motion is described by a random walk along a one-dimensional bounded environment. The sensing model and the characteristic of the environment require the searcher and the target to be on the same site at the same time to guarantee capture. The objective is to optimize the searcher's motion, given by a sequence of actions (move right, left or remain stationary), so that the probability of capturing the target is maximized. Each action is associated with an energy cost. The searcher strategy is constrained by a total energy budget. We propose a class of randomized strategies for which we provide an analytical expression for the capture probability as a function of a single parameter. We then use this expression to find the best strategy within this class. In addition to theoretical results, the algorithms are analyzed in simulation and compared with other intuitive solutions.

关键词： mobile robots optimisation probability random processes randomised algorithms search problems

来源：评论

学校读者我要写书评

暂无评论

Some New (And Old) Results on Contention Resolution 49

Some New (And Old) Results on Contention Resolution

引用

49th EATCS International Conference on Automata, Languages, and Programming, ICALP 2022

作者： Goldberg, Leslie Ann University of Oxford United Kingdom

This is an extended abstract of my talk at ICALP 2022, based on joint work with John Lapinskas. © Leslie Ann Goldberg;licensed under Creative Commons License CC-BY 4.0

ISBN: (纸本)9783959772358

This is an extended abstract of my talk at ICALP 2022, based on joint work with John Lapinskas. © Leslie Ann Goldberg;licensed under Creative Commons License CC-BY 4.0

关键词： contention resolution multiple access channel randomised algorithms

来源：评论

学校读者我要写书评

暂无评论

Planning Safe Cyclic Motions under Repetitive Task Constraints

Planning Safe Cyclic Motions under Repetitive Task Constrain...

引用

IEEE International Conference on Robotics and Automation (ICRA)

作者： Cefalo, Massimo Oriolo, Giuseppe Vendittelli, Marilena Univ Roma La Sapienza Dipartimento Ingn Informat Automat & Gest I-00185 Rome Italy

ISBN: (纸本)9781467356411;9781467356435

We consider motion planning in the presence of obstacles for redundant robotic systems subject to repetitive task constraints. For this open problem, we present a novel control-based randomized planner which produces cyclic, collision-free paths in configuration space and guarantees continuous satisfaction of the task constraints. In particular, the proposed algorithm relies on bidirectional search and loop closure in the task-constrained configuration space. Planning experiments on a simple 3R planar robot and the KUKA LWR-IV 7-dof manipulator are reported to show the effectiveness of the proposed method.

关键词： collision avoidance constraint satisfaction problems randomised algorithms redundant manipulators search problems

来源：评论

学校读者我要写书评

暂无评论

Reliable Service Allocation in Clouds

Reliable Service Allocation in Clouds

引用

IEEE 27th International Parallel and Distributed Processing Symposium (IPDPS)

作者： Beaumont, Olivier Eyraud-Dubois, Lionel Larcheveque, Hubert Univ Bordeaux INRIA Bordeaux Sud Ouest Bordeaux France

ISBN: (纸本)9780769549712

We consider several reliability problems that arise when allocating applications to processing resources in a Cloud computing platform. More specifically, we assume on the one hand that each computing resource is associated to a capacity constraint and to a probability of failure. On the other hand, we assume that each service runs as a set of independent instances of identical Virtual Machines, and that the Service Level Agreement between the Cloud provider and the client states that a minimal number of instances of the service should run with a given probability. In this context, given the capacity and failure probabilities of the machines, and the capacity and reliability demands of the services, the question for the cloud provider is to find an allocation of the instances of the services (possibly using replication) onto machines satisfying all types of constraints during a given time period. In this paper, our goal is to assess the impact of the reliability constraint on the complexity of resource allocation problems. We consider several variants of this problem, depending on the number of services and whether their reliability demand is individual or global. We prove several fundamental complexity results (#P' and NP-completeness results) and we provide several optimal and approximation algorithms. In particular, we prove that a basic randomized allocation algorithm, that is easy to implement, provides optimal or quasi-optimal results in several contexts, and we show through simulations that it also achieves very good results in more general settings.

关键词： approximation theory cloud computing computational complexity probability randomised algorithms software reliability virtual machines

来源：评论

学校读者我要写书评

暂无评论

Advanced optimization methods for power systems

Advanced optimization methods for power systems

引用

2014 Power Systems Computation Conference (PSCC)

作者： Panciatici, P. Campi, M. C. Garatti, S. Low, S. H. Molzahn, D. K. Sun, A. X. Wehenkel, L. RTE R&D Dept Versailles France Univ Brescia Dept Informat Engn Brescia Italy Politecn Milan Dept Elect Comp Sci & Bioengn Milan Italy CALTECH Div Engn & Appl Sci Pasadena CA 91125 USA Univ Michigan Dept EE&CS Ann Arbor MI 48109 USA Georgia Inst Technol H Milton Stewart Sch Ind & Syst Engn Atlanta GA 30332 USA Univ Liege Dept EE&CS Inst Montefiore B-4000 Liege Belgium

ISBN: (纸本)9788393580132

Power system planning and operation offers multitudinous opportunities for optimization methods. In practice, these problems are generally large-scale, non-linear, subject to uncertainties, and combine both continuous and discrete variables. In the recent years, a number of complementary theoretical advances in addressing such problems have been obtained in the field of applied mathematics. The paper introduces a selection of these advances in the fields of non-convex optimization, in mixed-integer programming, and in optimization under uncertainty. The practical relevance of these developments for power systems planning and operation are discussed, and the opportunities for combining them, together with high-performance computing and big data infrastructures, as well as novel machine learning and randomized algorithms, are highlighted.

关键词： Big Data concave programming integer programming learning (artificial intelligence) nonlinear programming parallel processing power engineering computing power system planning randomised algorithms Big Data infrastructure advanced optimization method high-performance computing machine learning mixed integer programming nonconvex optimization power system operation randomized algorithm Electronic mail Europe Linear programming Optimization Planning Power systems Uncertainty Power system planning randomized algorithms Integer Programming power systems High Performance Computing big data Power engineering computing electronic mail Nonlinear Programming PARALLEL PROCESSING (COMPUTERS) Optimization methods linear programming Uncertainty

来源：评论

学校读者我要写书评

暂无评论

A random coordinate descent method for large-scale resource allocation problems

A random coordinate descent method for large-scale resource ...

引用

51st IEEE Annual Conference on Decision and Control (CDC)

作者： Necoara, I. Univ Politehn Bucuresti Automat Control & Syst Engn Dept Bucharest 060042 Romania

ISBN: (纸本)9781467320665

In this paper we develop a randomized (block) coordinate descent method for solving singly linear equality constrained optimization problems that appear for example in resource allocation over networks. We show that for strongly convex objective functions the new algorithm has an expected linear convergence rate that depends on the second smallest eigenvalue lambda(2)(Q) of a matrix Q that is defined in terms of the probabilities and the number of blocks. However, the computational complexity per iteration of our method is much simpler than of a method based on full gradient information. We also focus on how to choose the probabilities to make this randomized algorithm to converge as fast as possible and we arrive at solving a sparse SDP. Finally, we present some numerical results for our method that show its efficiency on huge sparse problems.

关键词： computational complexity convergence of numerical methods convex programming eigenvalues and eigenfunctions iterative methods probability randomised algorithms resource allocation sparse matrices

来源：评论

学校读者我要写书评

暂无评论

A collaborative approach to stochastic load balancing with networked queues of autonomous service clusters

A collaborative approach to stochastic load balancing with n...

引用

International Conference on Collaborative Computing

作者： Lai, Cheng-Jia Polak, Wolfgang FX Palo Alto Lab 3400 Hillview AveBuilding 4 Palo Alto CA 94304 USA

ISBN: (纸本)9781424404285

Load balancing has been an increasingly important issue for handling computational intensive tasks in a distributed system such as in Grid and cluster computing. In such systems, multiple server instances are installed for handling requests from client applications, and each request (or task) typically needs to stay in a queue before an available server is assigned to process it. In this paper, we propose a high-performance queueing method for implementing a shared queue for collaborative clusters of servers. Each cluster of servers maintains a local queue and queues of different clusters are networked to form a unified (or shared) queue that may dispatch tasks to all available servers. We propose a new randomized algorithm for forwarding requests in an overcrowded local queue to a networked queue based on load information of the local and neighboring clusters. The algorithm achieves both load balancing and locality awareness.

关键词： groupware queueing theory randomised algorithms resource allocation workstation clusters autonomous service cluster collaborative server cluster high performance queueing locality awareness networked queue randomized algorithm shared queue stochastic loa

来源：评论

学校读者我要写书评

暂无评论

Tracking multiple agents in an intelligent space with probabilistic algorithms and a camera ring

Tracking multiple agents in an intelligent space with probab...

引用

IEEE International Symposium on Industrial Electronics (ISIE)

作者： Marron, M. Pizarro, D. Marcos, A. Jalvo, R. Garcia, J. C. Mazo, M. Univ Alcala de Henares Dept Elect Madrid 28871 Spain

ISBN: (纸本)9781424463916

Detecting, tracking and identifying different non-rigid agents in smart spaces is solved with a probabilistic filter proposed in this paper. A camera ring statically mounted in the intelligent space is used as observation system. Besides, three subsystems create the global detection and tracking algorithm: a three-dimensional reconstruction of these entities;a global tracker of all these entities made of a multimodal filter;and a deterministic classifier based on a connectivity map that obtains the individual agents in the smart space. A the end of the paper, different results and reliability statistics are presented in order to demonstrate the global functionality in real executions of the proposal presented.

关键词： camera ring cameras connectivity map deterministic classifier global tracker image reconstruction intelligent space multi-agent systems multimodal filter multiple agent tracking nonrigid agent observation system pattern classification probabilistic algorithm probabilistic filter randomised algorithms three dimensional reconstruction tracking

来源：评论

学校读者我要写书评

暂无评论

Combined Procedure with Randomized Controls for the Parameters' Confidence Region of Linear Plant under External Arbitrary Noise

Combined Procedure with Randomized Controls for the Paramete...

引用

51st IEEE Annual Conference on Decision and Control (CDC)

作者： Amelin, Konstantin Amelina, Natalia Granichin, Oleg Granichina, Olga St Petersburg State Univ Dept Math & Mech St Petersburg 198504 Russia

ISBN: (纸本)9781467320665

The new algorithm is proposed for the estimating of linear plant's unknown parameters in the case of observations with arbitrary external noises. It is based on adding of randomized inputs (test perturbations) through the feedback channel. The assumptions about the noise are reduced to a minimum: it can virtually be arbitrary but independently of it the user must be able to add test perturbations. We combine the previous result about asymptotic properties of randomized control strategy with the new one which is followed by a non-asymptotic approach of LSCR (Leave-out Sign-dominant Correlation Regions) method. The new algorithm gives confidence regions for series of finite sets of observations. These regions shrink to the true values of an unknown parameters when number of observations tents to infinity while the algorithm complexity does not increases.

关键词： computational complexity feedback linear systems parameter estimation perturbation techniques randomised algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：