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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

113 篇 会议
94 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

185 篇 工学
- 135 篇 计算机科学与技术...
- 68 篇 电气工程
- 20 篇 信息与通信工程
- 15 篇 软件工程
- 12 篇 控制科学与工程
- 9 篇 电子科学与技术（可...
- 5 篇 仪器科学与技术
- 4 篇 机械工程
- 4 篇 生物工程
- 2 篇 力学（可授工学、理...
- 1 篇 材料科学与工程（可...
- 1 篇 动力工程及工程热...
- 1 篇 测绘科学与技术
- 1 篇 化学工程与技术
- 1 篇 石油与天然气工程
- 1 篇 轻工技术与工程
- 1 篇 交通运输工程
- 1 篇 核科学与技术
- 1 篇 生物医学工程（可授...
64 篇 理学
- 43 篇 数学
- 16 篇 物理学
- 4 篇 生物学
- 4 篇 系统科学
- 2 篇 统计学（可授理学、...
13 篇 管理学
- 13 篇 管理科学与工程(可...
3 篇 农学
- 2 篇 作物学
1 篇 经济学
- 1 篇 理论经济学
1 篇 文学
- 1 篇 新闻传播学
1 篇 医学
- 1 篇 临床医学

主题

207 篇 deterministic al...
17 篇 randomized algor...
15 篇 distributed algo...
13 篇 algorithms
7 篇 optimisation
7 篇 stochastic proce...
6 篇 runtime
6 篇 computational co...
6 篇 deterministic al...
6 篇 deterministic
5 篇 network topology
5 篇 optimization
5 篇 stochastic algor...
5 篇 approximate comp...
4 篇 graph algorithms
4 篇 probability tree...
4 篇 lower bound
4 篇 treasure hunt
4 篇 matroid
4 篇 randomised algor...

机构

4 篇 nanyang technol ...
3 篇 indian inst tech...
3 篇 univ liverpool d...
2 篇 it univ copenhag...
2 篇 tel aviv univers...
2 篇 dhirubhai ambani...
2 篇 university of li...
2 篇 univ granada dep...
2 篇 univ hong kong d...
2 篇 microsoft res re...
2 篇 univ wroclaw wro...
2 篇 cheriton school ...
2 篇 univ politecn va...
2 篇 indian inst tech...
2 篇 computer science...
2 篇 univ granada dep...
2 篇 mit 77 massachus...
2 篇 univ chinese aca...
2 篇 univ salerno dip...
2 篇 indian inst tech...

作者

9 篇 kowalski dariusz...
5 篇 cano andres
5 篇 gomez-olmedo man...
4 篇 moral serafin
4 篇 de marco gianluc...
3 篇 gorain barun
3 篇 jurdzinski tomas...
3 篇 moses william k....
3 篇 ruzic milan
2 篇 moran feldman
2 篇 aaron bernstein
2 篇 pandit supantha
2 篇 lopez pedro
2 篇 bhattacharya adr...
2 篇 mondal kaushik
2 篇 buchbinder niv
2 篇 dimov ivan t.
2 篇 garg mohit
2 篇 gomez crispin
2 篇 feldman moran

语言

201 篇 英文
5 篇 其他
1 篇 荷兰文

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

共 207 条记录，以下是151-160 订阅

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

详细简洁

排序：

Treasure Hunt in Graph Using Pebbles 24th

Treasure Hunt in Graph Using Pebbles

引用

24th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)

作者： Bhattacharya, Adri Gorain, Barun Mandal, Partha Sarathi Indian Inst Technol Guwahati Gauhati 781039 India Indian Inst Technol Bhilai Bhilai India

ISBN: (纸本)9783031210167;9783031210174

In this paper, we study the treasure hunt problem in a graph by a mobile agent. The nodes in the graph G = (V, E) are anonymous and the edges incident to a vertex v is an element of V whose degree is deg(v) and they are labeled arbitrarily as 0, 1, ..., deg(v) - 1. At a node t in G a stationary object, called treasure is located. The mobile agent that is initially located at a node s in G, the starting point of the agent, must find the treasure by reaching the node t. The distance from s to t is D. The time required to find the treasure is the total number of edges the agent visits before it finds the treasure. The agent neither have any prior knowledge about the graph nor the position of the treasure. An oracle that knows the graph, the agent's initial position, and the position of the treasure, places some pebbles on the nodes, at most one per node, of the graph to guide the agent towards the treasure. This paper aims to study the trade-off between the number of pebbles provided and the time required to find the treasure. To be specific, we aim to answer the following question: - "What is the minimum time for treasure hunt in a graph with maximum degree Delta and diameter D if k pebbles are placed?" We answer the above question when k < D and k = cD for some positive integer c. We design efficient algorithms for the agent for different values of k. We also propose an almost matching lower bound result for k < D.

关键词： Treasure hunt Mobile agent Anonymous graph Pebbles deterministic algorithms

来源：评论

学校读者我要写书评

暂无评论

Dispersion of Mobile Robots: A Study of Memory-Time Trade-offs 18

Dispersion of Mobile Robots: A Study of Memory-Time Trade-of...

引用

19th International Conference on Distributed Computing and Networking (ICDCN)

作者： Augustine, John Moses, William K., Jr. Indian Inst Technol Madras Dept Comp Sci & Engn Chennai Tamil Nadu India

ISBN: (纸本)9781450363723

We introduce a new problem in the domain of mobile robots, which we term dispersion. In this problem, n robots are placed in an n node graph arbitrarily and must coordinate with each other to reach a final configuration such that exactly one robot is at each node. We study this problem through the lenses of minimizing the memory required by each robot and of minimizing the number of rounds required to achieve dispersion. Dispersion is of interest due to its relationship to the problems of scattering on a graph, exploration using mobile robots, and load balancing on a graph. Additionally, dispersion has an immediate real world application due to its relationship to the problem of recharging electric cars, as each car can be considered a robot and recharging stations and the roads connecting them nodes and edges of a graph respectively. Since recharging is a costly affair relative to traveling, we want to distribute these cars amongst the various available recharge points where communication should be limited to car-to-car interactions. We provide lower bounds on both the memory required for robots to achieve dispersion and the minimum running time to achieve dispersion on any type of graph. We then analyze the trade-offs between time and memory for various types of graphs. We provide time optimal and memory optimal algorithms for several types of graphs and show the power of a little memory in terms of running time.

关键词： Dispersion Load balancing Mobile robots Collective robot exploration Scattering Uniform deployment Graph algorithms deterministic algorithms Distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

The Parity of Directed Hamiltonian Cycles

The Parity of Directed Hamiltonian Cycles

引用

IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS)

作者： Bjorklund, Andreas Husfeldt, Thore Lund Univ Dept Comp Sci S-22100 Lund Sweden

ISBN: (纸本)9780769551357

We present a deterministic algorithm that given any directed graph on n vertices computes the parity of its number of Hamiltonian cycles in O(1.619(n)) time and polynomial space. For bipartite graphs, we give a 1.5(n)poly(n) expected time algorithm. Our algorithms are based on a new combinatorial formula for the number of Hamiltonian cycles modulo a positive integer.

关键词： computational complexity deterministic algorithms directed graphs

来源：评论

学校读者我要写书评

暂无评论

Decentralized network coding

Decentralized network coding

引用

IEEE Information Theory Workshop

作者： Fragouli, C Soljanin, E EPFL Sch Comp & Commun Sci CH-1015 Lausanne Switzerland

ISBN: (纸本)0780387201

This paper proposes deterministic algorithms for decentralized network coding. Decentralized coding allows to locally specify the coding operations at network nodes without knowledge of the overall network topology, and to accommodate future changes in the network such as addition of receivers. To the best of our knowledge, these are the first deterministic decentralized algorithms proposed for network coding.

关键词： deterministic algorithms telecommunication network routing codes directed graphs network changes decentralized algorithms network nodes decentralized network coding deterministic algorithms telecommunication network routing Network coding directed graphs Decentralized network node Network topology

来源：评论

学校读者我要写书评

暂无评论

The Complexity of Renaming

The Complexity of Renaming

引用

52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS)

作者： Alistarh, Dan Aspnes, James Gilbert, Seth Guerraoui, Rachid Ecole Polytech Fed Lausanne Lausanne Switzerland NUS Singapore Singapore Yale Univ New Haven CT 06520 USA

ISBN: (纸本)9780769545714

We study the complexity of renaming, a fundamental problem in distributed computing in which a set of processes need to pick distinct names from a given namespace. We prove an individual lower bound of Omega(k) process steps for deterministic renaming into any namespace of size sub-exponential in k, where k is the number of participants. This bound is tight: it draws an exponential separation between deterministic and randomized solutions, and implies new tight bounds for deterministic fetch-and-increment registers, queues and stacks. The proof of the bound is interesting in its own right, for it relies on the first reduction from renaming to another fundamental problem in distributed computing: mutual exclusion. We complement our individual bound with a global lower bound of Omega(k log(k/c)) on the total step complexity of renaming into a namespace of size c k, for any c >= 1. This applies to randomized algorithms against a strong adversary, and helps derive new global lower bounds for randomized approximate counter and fetch-and-increment implementations, all tight within logarithmic factors.

关键词： Adaptation models Adaptive systems Complexity theory Radiation detectors Registers Sorting Wires approximation theory computational complexity deterministic algorithms deterministic fetch and increment queues deterministic fetch and increment register det

来源：评论

学校读者我要写书评

暂无评论

Research on Algorithm Design and Control Strategies for Complex Systems Based on Mathematical Models

Research on Algorithm Design and Control Strategies for Comp...

引用

2024 International Conference on Power, Electrical Engineering, Electronics and Control, PEEEC 2024

作者： Guo, Lihua Shandong Business Institute Shandong Yantai264000 China

ISBN: (纸本)9798350378917

The study of algorithm design and control strategies based on mathematical models has become particularly important in the current context of increasing complex systems. The aim of this study is to explore how mathematical models can be used to design efficient algorithms and apply them to the control of complex systems. First, we provide an overview of relevant mathematical models and basic concepts and discuss their importance in algorithm design. We then delve into the design methods of deterministic, stochastic, and heuristic algorithms, and provide examples of practical applications of these methods. We then explore several commonly used control strategies for complex systems, including feedback control mechanisms, adaptive control strategies, and predictive control models. Through specific case studies, we demonstrate the effectiveness of the practical application of these strategies in industrial, environmental, and technological systems. The research results show that the algorithms designed based on mathematical models have significant advantages in complex system control and can significantly improve the stability and efficiency of the system. Finally, we summarize the main findings of the study and look ahead to possible directions for future research, suggesting further applications and developments in different fields. © 2024 IEEE.

关键词： algorithm design complex systems control strategies deterministic algorithms Mathematical modeling system dynamics

来源：评论

学校读者我要写书评

暂无评论

deterministic equation solving over finite fields 05

Deterministic equation solving over finite fields

引用

Proceedings of the 2005 international symposium on Symbolic and algebraic computation

作者： Christiaan van de Woestijne Universiteit Leiden RA Leiden The Netherlands

ISBN: (纸本)9781595930958

deterministic algorithms are presented for the efficient solution of diagonal homogeneous equations in many variables over finite fields. As auxiliary algorithms, it is shown how to compute a field generator that is an nth power, and how to write elements as sums of nth powers, for a given integer n. All these algorithms take polynomial time in n and in the logarithm of the field size, and are practical as stated.

关键词： deterministic algorithms

来源：评论

学校读者我要写书评

暂无评论

Reducing Leakage Power in Wearable Medical Devices Using Memory Nap Controller 10

Reducing Leakage Power in Wearable Medical Devices Using Mem...

引用

10th IEEE Dallas Circuits and Systems Conference (IEEE DCAS)

作者： Olorode, Oluleye Nourani, Mehrdad Univ Texas Dallas Dept Elect Engn Dallas TX 75080 USA

ISBN: (纸本)9781479959242

The increasing demand for wearable medical devices, coupled with their short battery life, has led to a renewed interest in low power processors. A significant proportion of the total power consumed by these medical device processors, occur in the memory systems, and therefore the focus of sour work. In this paper, we propose a technique that reduces the static power consumption in caches with no side effect on processor performance. Our proposed architecture achieves this power saving by deterministically lowering the power state of cache lines that are guaranteed not to be accessed in immediate future cycles. We simulated our architecture across different cache configurations, using widely known CAD tools, and observed up to 92% reduction in static power consumption on SPEC2006 benchmarks with no performance penalties and minimal hardware overhead. Category: [Theme based] - wearable computing, medical and automotive electronics

关键词： CAD biomedical electronics biomedical telemetry body sensor networks cache storage deterministic algorithms low-power electronics medical control systems power consumption telemedicine CAD tool SPEC2006 benchmark cache configuration cache line power state lowering cache static power consumption reduction deterministic power state lowering leakage power reduction low power processor medical device processor memory nap controller memory system minimal hardware overhead performance penalty power consumption reduction side effect power saving processor architecture processor perforemance short battery life simulation total power consumption wearable medical device Biomedical monitoring Decoding Hardware Hidden Markov models Medical diagnostic imaging Power demand Random access memory [Theme based] — wearable computing medical and automotive electronics Power consumption Cache Memory System biomedical telemetry medical control systems Biomedical monitoring deterministic algorithms Body sensor networks Processor Architectures cache storage random access machine Power demand low-power electronics Battery Life Hidden Markov models Computer hardware

来源：评论

学校读者我要写书评

暂无评论

Artificial Neural Networks Generated by Low Discrepancy Sequences 14th

Artificial Neural Networks Generated by Low Discrepancy Sequ...

引用

14th International Conference on Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing (MCQMC)

作者： Keller, Alexander Van Keirsbilck, Matthijs NVIDIA Fasanenstr 81 D-10623 Berlin Germany

ISBN: (纸本)9783030983192;9783030983185

Artificial neural networks can be represented by paths. Generated as random walks on a dense network graph, we find that the resulting sparse networks allow for deterministic initialization and even weights with fixed sign. Such networks can be trained sparse from scratch, avoiding the expensive procedure of training a dense network and compressing it afterwards. Although sparse, weights are accessed as contiguous blocks of memory. In addition, enumerating the paths using deterministic low discrepancy sequences, for example variants of the Sobol' sequence, amounts to connecting the layers of neural units by progressive permutations, which naturally avoids bank conflicts in parallel computer hardware. We demonstrate that the artificial neural networks generated by low discrepancy sequences can achieve an accuracy within reach of their dense counterparts at a much lower computational complexity.

关键词： Neural networks Low discrepancy sequences Sparsity deterministic algorithms Parallel computer hardware

来源：评论

学校读者我要写书评

暂无评论

A UNIFIED RACE ALGORITHM FOR OFFLINE PARAMETER TUNING

A UNIFIED RACE ALGORITHM FOR OFFLINE PARAMETER TUNING

引用

Winter Simulation Conference

作者： van Dijk, Tim Mes, Martijn Schutten, Marco Gromicho, Joaquim Univ Twente Dep Ind Engn & Business Informat Syst Drienerlolaan 5 NL-7522 Enschede Netherlands ORTEC Software Dev Dep Algorithm Innovat NL-2719 Zoetermeer Netherlands

ISBN: (纸本)9781479974863

This paper proposes uRace, a unified race algorithm for efficient offline parameter tuning of deterministic algorithms. We build on the similarity between a stochastic simulation environment and offline tuning of deterministic algorithms, where the stochastic element in the latter is the unknown problem instance given to the algorithm. Inspired by techniques from the simulation optimization literature, uRace enforces fair comparisons among parameter configurations by evaluating their performance on the same training instances. It relies on rapid statistical elimination of inferior parameter configurations and an increasingly localized search of the parameter space to quickly identify good parameter settings. We empirically evaluate uRace by applying it to a parameterized algorithmic framework for loading problems at ORTEC, a global provider of software solutions for complex decision-making problems, and obtain competitive results on a set of practical problem instances from one of the world's largest multinationals in consumer packaged goods.

关键词： decision making deterministic algorithms search problems stochastic processes ORTEC complex decision-making problems consumer packaged goods global software solution provider offline parameter tuning parameterized algorithmic framework performance evaluation statistical elimination stochastic element stochastic simulation environment uRace unified race algorithm Containers Loading Optimization Software Software algorithms Training Tuning

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共21页 << < 12 13 14 15 16 17 18 19 20 21 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：