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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

115 篇 期刊文献
113 篇 会议

馆藏范围

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

日期分布

学科分类号

197 篇 工学
- 142 篇 计算机科学与技术...
- 67 篇 电气工程
- 21 篇 信息与通信工程
- 14 篇 控制科学与工程
- 14 篇 软件工程
- 9 篇 电子科学与技术（可...
- 5 篇 机械工程
- 5 篇 仪器科学与技术
- 4 篇 生物工程
- 2 篇 力学（可授工学、理...
- 2 篇 动力工程及工程热...
- 2 篇 化学工程与技术
- 2 篇 石油与天然气工程
- 1 篇 材料科学与工程（可...
- 1 篇 测绘科学与技术
- 1 篇 矿业工程
- 1 篇 轻工技术与工程
- 1 篇 交通运输工程
82 篇 理学
- 57 篇 数学
- 20 篇 物理学
- 5 篇 系统科学
- 4 篇 生物学
- 2 篇 统计学（可授理学、...
- 1 篇 化学
- 1 篇 地球物理学
- 1 篇 地质学
13 篇 管理学
- 13 篇 管理科学与工程(可...
3 篇 农学
- 2 篇 作物学
1 篇 经济学
- 1 篇 理论经济学
1 篇 文学
- 1 篇 新闻传播学
1 篇 医学

主题

228 篇 deterministic al...
20 篇 randomized algor...
19 篇 algorithms
15 篇 distributed algo...
8 篇 stochastic proce...
7 篇 lower bound
7 篇 optimisation
7 篇 deterministic
6 篇 runtime
6 篇 computational co...
6 篇 deterministic al...
5 篇 network topology
5 篇 optimization
5 篇 computational mo...
5 篇 stochastic algor...
5 篇 probability
5 篇 stochastic analy...
5 篇 approximate comp...
4 篇 parallel algorit...
4 篇 graph algorithms

机构

3 篇 indian inst tech...
3 篇 univ liverpool d...
3 篇 nanyang technol ...
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

语言

216 篇 英文
11 篇 其他
1 篇 荷兰文

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

共 228 条记录，以下是51-60 订阅

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

详细简洁

排序：

ColorCast: deterministic Broadcast in Powerline Networks with Uncertainties

ColorCast: Deterministic Broadcast in Powerline Networks wit...

引用

2014 IEEE International Conference on Smart Grid Communications (SmartGridComm)

作者： Pignolet, Yvonne Anne Schmid, Stefan Tredan, Gilles ABB Corp Res Baden Switzerland Telekom Innovat Labs Berlin Germany TU Berlin Berlin Germany CNRS LAAS Toulouse France

ISBN: (纸本)9781479949342

This paper initiates the study of broadcast in a powerline communication network, where nodes communicate by local broadcasts in the grid, and where the quality of the communication links is subject to uncertainty. We first show that state-of-the-art broadcast algorithms for known topologies fail to broadcast messages in such a challenging environment, even when the link quality uncertainty is small. We then present a deterministic algorithm COLORCAST that distributes a message to all nodes in the network in time T(n). The algorithm is based on graph coloring and avoids collisions while guaranteeing a high parallelism. In particular, COLORCAST strictly outperforms existing deterministic broadcast algorithms for unknown topologies in the sense that its time complexity is asymptotically lower than the best possible runtime for the unknown setting. Our formal analysis is complemented with a simulation study on real grid topologies, which confirms the benefits of COLORCAST compared to state-of-the-art protocols.

关键词： broadcast communication carrier transmission on power lines deterministic algorithms graph colouring power grids telecommunication network topology COLORCAST communication links deterministic broadcast algorithms graph coloring link quality uncertainty local broadcasts powerline communication network real grid topologies state-of-the-art broadcast algorithms time complexity Network topology Noise level Schedules Smart grids Time complexity Topology Uncertainty colored graph complexity classes carrier transmission on power lines Telecommunication links deterministic algorithms Smart grids telecommunication network topology Power grids Noise levels Network topology Uncertainty topology Broadcast Network Power cables

来源：评论

学校读者我要写书评

暂无评论

deterministic Graph Coloring in the Streaming Model* 2022

Deterministic Graph Coloring in the Streaming Model*

引用

54th Annual ACM SIGACT Symposium on Theory of Computing (STOC)

作者： Assadi, Sepehr Chen, Andrew Sun, Glenn Rutgers State Univ New Brunswick NJ 08854 USA Cornell Univ Ithaca NY 14853 USA Univ Calif Los Angeles Los Angeles CA 90024 USA

ISBN: (纸本)9781450392648

Recent breakthroughs in graph streaming have led to design of semi-streaming algorithms for various vertex coloring problems such as (Delta+ 1)-coloring, degeneracy-coloring, coloring triangle-free graphs, and others. These algorithms are all randomized in crucial ways and whether or not there is any deterministic analogue of them has remained an important open question in this line of work. We settle this fundamental question by proving that there is no deterministic single-pass semi-streaming algorithm that given a graph.. with maximum degree Delta, can output a proper coloring of.. using any number of colors which is sub-exponential in Delta. Our proof is based on analyzing the multi-party communication complexity of a related communication game, using random graph theory type arguments that may be of independent interest. We complement our lower bound by showing that one extra pass over the input allows one to recover an O (Delta(2)) coloring via a deterministic semi-streaming algorithm. This result is extended to an O (Delta) coloring in O (log Delta) passes even in dynamic streams.

关键词： Graph coloring streaming deterministic algorithms lower bounds

来源：评论

学校读者我要写书评

暂无评论

deterministic Mincut in Almost-Linear Time 2021

Deterministic Mincut in Almost-Linear Time

引用

53rd Annual ACM SIGACT Symposium on Theory of Computing (STOC)

作者： Li, Jason Carnegie Mellon Univ Pittsburgh PA 15213 USA Microsoft Res Redmond WA USA

ISBN: (纸本)9781450380539

We present a deterministic (global) mincut algorithm for weighted, undirected graphs that runs in m(1)(+o(1)) time, answering an open question of Karger from the 1990s. To obtain our result, we derandomize the construction of the skeleton graph in Karger's near-linear time mincut algorithm, which is its only randomized component. In particular, we partially de-randomize the well-known Benczur-Karger graph sparsification technique by random sampling, which we accomplish by the method of pessimistic estimators. Our main technical component is designing an efficient pessimistic estimator to capture the cuts of a graph, which involves harnessing the expander decomposition framework introduced in recent work by Goranci et al. (SODA 2021). As a side-effect, we obtain a structural representation of all approximate mincuts in a graph, which may have future applications.

关键词： minimum cut deterministic algorithms de-randomization graph sparsification

来源：评论

学校读者我要写书评

暂无评论

Transmission Strategies for Gaussian Relay Networks Obtained from deterministic Models

Transmission Strategies for Gaussian Relay Networks Obtained...

引用

IEEE Global Telecommunications Conference (GLOBECOM 2010)

作者： Schrammar, Nicolas Skoglund, Mikael KTH Royal Inst Technol Sch Elect Engn Stockholm Sweden KTH Royal Inst Technol ACCESS Linnaeus Ctr Stockholm Sweden

ISBN: (纸本)9781424456383

A constant gap between the deterministic model of a class of a wireless relay network and its Gaussian model counterpart is derived. The method is constructive in the sense that a transmission solution in the deterministic model that obeys certain constraints can directly be translated into a transmission in the Gaussian model. We show that the rate in the Gaussian model is at most a constant gap below the rate in the deterministic model, and we derive an upper bound on this gap.

关键词： Gaussian model Gaussian processes data communication deterministic algorithms deterministic models radiocommunication relays transmission strategy wireless relay network

来源：评论

学校读者我要写书评

暂无评论

Making deterministic Signatures Quickly 18

Making Deterministic Signatures Quickly

引用

18th ACM-SIAM Symposium on Discrete algorithms

作者： Ruzic, Milan IT Univ Copenhagen DK-2300 Copenhagen Denmark

ISBN: (纸本)9780898716245

We present a new technique of universe reduction. Primary applications are the dictionary problem and the predecessor problem. We give several new results on static dictionaries in different computational models: the word RAM, the practical RAM, and the cache-oblivious model. All algorithms and data structures are deterministic and use linear space. Representative results are: a dictionary with a lookup time of O(log log n) and construction time of O(n) on sorted input on a word RAM, and a static predecessor structure for variable-and unbounded length binary strings that in the cache-oblivious model has a query performance of O(vertical bar s vertical bar/B + log vertical bar s vertical bar) I/Os, for query argument s.

关键词： deterministic algorithms perfect hashing

来源：评论

学校读者我要写书评

暂无评论

An accurate combinatorial model for performance prediction of deterministic wormhole routing in torus multicomputer systems

An accurate combinatorial model for performance prediction o...

引用

IEEE International Conference on Computer Design

作者： Najaf-Abadi, HH Sarbazi-Azad, H Sch Comp Sci IPM Tehran Iran

ISBN: (纸本)0769522319

Although several analytical models have been proposed in the literature for different interconnection networks with deterministic routing, very few of them have considered the effects of virtual channel multiplexing on network performance. This paper proposes a new analytical model to compute message latency in a general n-dimensional torus network with an arbitrary number of virtual channels per physical channel. Unlike the previous models proposed for toroidal-based networks, this model uses a combinatorial approach to consider all different possible cases for the source-destination pairs, thus resulting in an accurate prediction. The results obtained from simulation experiments confirm that the proposed model exhibits a high degree of accuracy for various network sizes, under different operating conditions, compared to a similar model proposed very recently [16], which considers virtual channel utilization in the k-ary n-cube network.

关键词： multiprocessor interconnection networks combinatorial mathematics deterministic algorithms deterministic wormhole routing torus multicomputer systems interconnection networks virtual channel multiplexing message latency source-destination pairs k-ary n-cube network Interconnection networks multiprocessor interconnection networks combinatorial mathematics deterministic algorithms Routeing virtual channels performance prediction ANALYSIS MODELS multicomputer

来源：评论

学校读者我要写书评

暂无评论

Multi-Scaling deterministic Imaging for GPR Survey

Multi-Scaling Deterministic Imaging for GPR Survey

引用

IEEE Conference on Antenna Measurements and Applications (CAMA)

作者： Moriyama, Toshifumi Salucci, Marco Oliveri, Giacomo Tenuti, Lorenza Rocca, Paolo Massa, Andrea Nagasaki Univ Dept Elect & Elect Engn Nagasaki 8528521 Japan Univ Trent ELEDIA Res Ctr DISI I-38123 Trento Italy

ISBN: (纸本)9781479936786

The retrieval of the dielectric characteristics of 2-D objects buried in a lossy half-space from Ground Penetrating Radar (GPR) measurements is dealt with. The proposed imaging algorithm is able to effectively mitigate the effects of both non-linearity and ill-posedness of the inversion problem through a multi-scaling deterministic approach based on a Conjugate Gradient minimization (IMSA-CG), while its integration within a Frequency Hopping (FH) strategy guarantees a profitable exploitation of the multi-frequency nature of realistic GPR measurements. The effectiveness of the proposed technique is shown by numerical simulations, and a direct comparison with a single-scaling "bare" implementation is given.

关键词： conjugate gradient methods deterministic algorithms ground penetrating radar inverse problems radar imaging spread spectrum radar 2D object buried dielectric characteristics retrieval FH strategy GPR IMSA-CG conjugate gradient minimization frequency hopping strategy ground penetrating radar measurement ill-posedness mitigation inversion problem multiscaling deterministic imaging approach nonlinearity mitigation Dielectrics Electromagnetics Frequency measurement Ground penetrating radar Image reconstruction Radar imaging ground penetrating radar Radar imaging deterministic algorithms conjugate gradient methods frequency measurement Electromagnetism Electromagnetic fields Dielectrics image reconstruction Inverse method spread spectrum radar multi-scale

来源：评论

学校读者我要写书评

暂无评论

deterministic and Metaheuristic Approaches to Solving Kakuro Puzzles

Deterministic and Metaheuristic Approaches to Solving Kakuro...

引用

2nd Mediterranean Conference on Embedded Computing (MECO)

作者： Panov, Stojanche Koceski, Saso Goce Delchev Univ Fac Comp Sci Stip Macedonia

ISBN: (纸本)9789940943615

This research study introduces two new approaches to solving Kakuro puzzles. One of them is metaheuristic and is based on Harmony Search methodology, and the other one is a novel deterministic method named Reducing Domain Values. Both of them have been examined and tested with different puzzles having various grid sizes. They were also compared with two known techniques Forward Checking and Iterative Sampling. As results have shown, the newly introduced approaches gave better performances in terms of time and provided great foundation for developing game theory algorithms.

关键词： deterministic algorithms Game theory Grid-based games Heuristic algorithms Puzzle

来源：评论

学校读者我要写书评

暂无评论

A deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond 61

A Deterministic Algorithm for Balanced Cut with Applications...

引用

61st IEEE Annual Symposium on Foundations of Computer Science (FOCS)

作者： Chuzhoy, Julia Gao, Yu Li, Jason Nanongkai, Danupon Peng, Richard Saranurak, Thatchaphol TTIC Chicago IL 60637 USA Georgia Tech Atlanta GA USA CMU Pittsburgh PA USA KTH Stockholm Sweden

ISBN: (纸本)9781728196213

We consider the classical Minimum Balanced Cut problem: given a graph G, compute a partition of its vertices into two subsets of roughly equal volume, while minimizing the number of edges connecting the subsets. We present the first deterministic, almost-linear time approximation algorithm for this problem. Specifically, our algorithm, given an n-vertex m-edge graph G and any parameter 1 <= r <= O(log n), computes a (log m)(r2)-approximation for Minimum Balanced Cut in G, in time O (m(1+O(1/r)+o(1)) . (log m)(O(r2))). In particular, we obtain a (log m)(1/epsilon)-approximation in time m(1+O(root epsilon)) for any constant epsilon > 0, and a (log m)(f(m))-approximation in time m(1+o(1)), for any slowly growing function f(m). We obtain deterministic algorithms with similar guarantees for the Sparsest Cut and the Lowest-Conductance Cut problems. Our algorithm for the Minimum Balanced Cut problem in fact provides a stronger guarantee: it either returns a balanced cut whose value is close to a given target value, or it certifies that such a cut does not exist by exhibiting a large subgraph of G that has high conductance. We use this algorithm to obtain deterministic algorithms for dynamic connectivity and minimum spanning forest, whose worst-case update time on an n-vertex graph is n(o(1)), thus resolving a major open problem in the area of dynamic graph algorithms. Our work also implies deterministic algorithms for a host of additional problems, whose time complexities match, up to subpolynomial in n factors, those of known randomized algorithms. The implications include almost-linear time deterministic algorithms for solving Laplacian systems and for approximating maximum flows in undirected graphs.

关键词： deterministic algorithms dynamic connectivity balanced cuts maximum flow Laplacian solvers

来源：评论

学校读者我要写书评

暂无评论

deterministic Digital Clustering of Wireless Ad Hoc Networks 18

Deterministic Digital Clustering of Wireless Ad Hoc Networks

引用

37th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC)

作者： Jurdzinski, Tomasz Kowalski, Dariusz R. Rozanski, Michal Stachowiak, Grzegorz Univ Wroclaw Inst Comp Sci Wroclaw Poland Univ Liverpool Dept Comp Sci Liverpool Merseyside England

ISBN: (纸本)9781450357951

We consider deterministic distributed communication in wireless ad hoc networks of identical devices in the SINR model without predefined infrastructure. Most algorithmic results in this model rely on additional features or capabilities, e.g., randomization, access to geographic coordinates, power control, carrier sensing with various precision of measurements, and interference cancellation. We study a pure scenario, when no such features are available. Several distributed algorithms have been presented in recent years for the local and global broadcast problems considered in this paper. However, all these solutions were either randomized or relied on the assumption that nodes of a network know their own coordinates in a given metric space or devices has signal sensitivity limited to some area (typically smaller than transmission range). In contrast, the aim of this paper is to check how efficient could be solutions without randomization, availability of locations, limited sensitivity, power control, carrier sensing, interference cancellation or other features. Our research objective is motivated twofolds. Firstly, examination of necessity and impact' of randomization is a natural research topic in algorithm design. Moreover, as wireless ad hoc networks are usually built from computationally limited devices run on batteries, it is desirable to use simple and energy efficient algorithms which do not need access to several sensing capabilities or true randomness. As a general tool, we develop a deterministic distributed clustering algorithm, which splits nodes of a multi-hop ad hoc network into clusters of constant diameter. Our solution relies on a new type of combinatorial structures (called witnessed strong selectors), which might be of independent interest. Using the clustering, we develop a deterministic distributed local broadcast algorithm accomplishing this task in O(Delta log* N log N) rounds, where Delta is the density of a network. This is the first solutio

关键词： ad hoc networks wireless networks broadcast clustering selectors deterministic algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共23页 << < 2 3 4 5 6 7 8 9 10 11 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：