咨询与建议

限定检索结果

文献类型

  • 39 篇 期刊文献
  • 5 篇 会议

馆藏范围

  • 44 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 29 篇 理学
    • 27 篇 数学
    • 5 篇 统计学(可授理学、...
    • 1 篇 物理学
    • 1 篇 生物学
  • 24 篇 工学
    • 18 篇 计算机科学与技术...
    • 5 篇 电气工程
    • 3 篇 信息与通信工程
    • 2 篇 软件工程
    • 1 篇 材料科学与工程(可...
  • 17 篇 管理学
    • 17 篇 管理科学与工程(可...
  • 2 篇 教育学
    • 2 篇 心理学(可授教育学...
  • 1 篇 经济学
    • 1 篇 应用经济学

主题

  • 44 篇 tree algorithms
  • 4 篇 networks/graphs
  • 3 篇 maximum stable t...
  • 3 篇 random access
  • 2 篇 search/surveilla...
  • 2 篇 multiresolution ...
  • 2 篇 sensitivity anal...
  • 2 篇 clustering metho...
  • 2 篇 statistical mult...
  • 2 篇 collision resolu...
  • 2 篇 lowest common an...
  • 2 篇 monte carlo stud...
  • 2 篇 facility locatio...
  • 2 篇 batch conflict r...
  • 2 篇 wavelets
  • 2 篇 games/group deci...
  • 2 篇 rfid
  • 2 篇 delay
  • 1 篇 parallel algorit...
  • 1 篇 frames

机构

  • 2 篇 univ appl sci te...
  • 2 篇 rutgers business...
  • 2 篇 aalborg univ cti...
  • 2 篇 univ kaiserslaut...
  • 1 篇 st petersburg el...
  • 1 篇 tel aviv univ sc...
  • 1 篇 univ lisbon cmaf...
  • 1 篇 natl marrow dono...
  • 1 篇 department of co...
  • 1 篇 univ minnesota d...
  • 1 篇 us naval res lab...
  • 1 篇 univ penn wharto...
  • 1 篇 aalborg univ dep...
  • 1 篇 tech univ wien k...
  • 1 篇 inst univ lisboa...
  • 1 篇 univ lisbon ctr ...
  • 1 篇 univ washington ...
  • 1 篇 univ estadual ca...
  • 1 篇 univ antwerp imi...
  • 1 篇 directorate gen ...

作者

  • 3 篇 van houdt b.
  • 2 篇 popovski petar
  • 2 篇 peeters g. t.
  • 2 篇 prasad ramjee
  • 2 篇 lidbetter thomas
  • 2 篇 schreiner m
  • 2 篇 freeden w
  • 2 篇 salowe js
  • 2 篇 fitzek frank h. ...
  • 2 篇 block r.
  • 1 篇 cardoso margarid...
  • 1 篇 ibrahim osama ta...
  • 1 篇 schieber b
  • 1 篇 zhang chongtian
  • 1 篇 zou wei
  • 1 篇 szymanski tg
  • 1 篇 polyzos george c...
  • 1 篇 ullman jd
  • 1 篇 bauer f
  • 1 篇 chen yizhuo

语言

  • 43 篇 英文
  • 1 篇 其他
检索条件"主题词=tree algorithms"
44 条 记 录,以下是1-10 订阅
排序:
tree algorithms in wavelet approximations by Helmholtz potential operators
收藏 引用
NUMERICAL FUNCTIONAL ANALYSIS AND OPTIMIZATION 2003年 第7-8期24卷 747-782页
作者: Freeden, W Mayer, C Schreiner, M Univ Kaiserslautern Geomath Grp D-67653 Kaiserslautern Germany Univ Appl Sci Technol Lab Ind Math Buchs Switzerland
By means of the limit and jump relations of classical potential theory with respect to the Helmholtz equation a wavelet approach is established on a regular surface. The multiscale procedure is constructed in such a w... 详细信息
来源: 评论
Interference Cancellation tree algorithms with k-Signal Memory Locations
收藏 引用
IEEE TRANSACTIONS ON COMMUNICATIONS 2010年 第11期58卷 3056-3061页
作者: Peeters, G. T. van Houdt, B. Univ Antwerp IBBT B-2020 Antwerp Belgium
Recently, tree algorithms have been combined with successive interference cancellation to achieve a substantially higher maximum stable throughput (MST). All previous work assumed either a single or an unbounded numbe... 详细信息
来源: 评论
A branching process approach to compute the delay and energy efficiency of tree algorithms with free access
收藏 引用
COMPUTER NETWORKS 2014年 第0期58卷 13-28页
作者: Block, R. Peeters, G. T. Van Houdt, B. Univ Antwerp iMinds Dept Math & Comp Sci B-2020 Antwerp Belgium
This paper presents a branching process approach to determine the main performance measures of a variety of conflict resolution algorithms known as tree algorithms with free access. In particular we present an efficie... 详细信息
来源: 评论
COMPUTATIONAL EXPERIENCE WITH MINIMUM SPANNING tree algorithms
收藏 引用
OPERATIONS RESEARCH LETTERS 1983年 第1期2卷 36-41页
作者: JARVIS, JP WHITED, DE CLEMSON UNIV DEPT MATH SCI CLEMSON SC 29631 USA
The empirical performance of the algorithms of Kruskal, Prim, and Sollin for determining a minimum spanning tree is examined and found to be considerably better than suggested by worst case analysis. Kruskal's alg... 详细信息
来源: 评论
Forest FIRE and FIRE Wood: Tools for tree Automata and tree algorithms
Forest FIRE and FIRE Wood: Tools for Tree Automata and Tree ...
收藏 引用
7th International Workshop on Finite-State Methods and Natural Language Processing
作者: Cleophas, Lock Eindhoven Univ Technol Dept Math & Comp Sci Software Engn & Technol Grp NL-5600 MB Eindhoven Netherlands
Pattern matching, acceptance, and parsing algorithms on node-labeled, ordered, ranked trees (live algorithms') are important for applications such as instruction selection and tree transformation/term rewriting. M... 详细信息
来源: 评论
An Efficient Load Balancing Method for tree algorithms  13
An Efficient Load Balancing Method for Tree Algorithms
收藏 引用
13th IEEE Int Conf on Ubiquitous Intelligence and Comp/13th IEEE Int Conf on Adv and Trusted Comp/16th IEEE Int Conf on Scalable Comp and Commun/IEEE Int Conf on Cloud and Big Data Comp/IEEE Int Conf on Internet of People/IEEE Smart World Congress
作者: Ibrahim, Osama Talaat El-Mahdy, Ahmed Egypt Japan Univ Sci & Technol Comp Sci & Engn Dept Alexandria Egypt
Nowadays, multiprocessing is mainstream with exponentially increasing number of processors. Load balancing is, therefore, a critical operation for the efficient execution of parallel algorithms. In this paper we consi... 详细信息
来源: 评论
tree-algorithms With Multi-Packet Reception and Successive Interference Cancellation
收藏 引用
IEEE TRANSACTIONS ON COMMUNICATIONS 2023年 第11期71卷 6287-6300页
作者: Stefanovic, Cedomir Deshpande, Yash Gursu, H. Murat Kellerer, Wolfgang Aalborg Univ Dept Elect Syst DK-9220 Aalborg Denmark Tech Univ Munich Chair Commun Networks D-80333 Munich Germany Nokia Stand D-81541 Munich Germany
In this paper, we study binary tree-algorithms that exploit a combination of multi-packet reception (MPR) and successive interference cancellation (SIC), which so far has not been considered in the literature. Specifi... 详细信息
来源: 评论
Search for an Immobile Hider on a Binary tree with Unreliable Locational Information
收藏 引用
OPERATIONS RESEARCH 2025年 第2期73卷 iii-viii, 583-1150, C2-C3页
作者: Alpern, Steve Lidbetter, Thomas Univ Warwick Warwick Business Sch Coventry CV4 7AL England Rutgers Business Sch Dept Management Sci & Informat Syst Newark NJ 07102 USA
Adversarial search of a network for an immobile Hider (or target) was introduced and solved for rooted trees by Shmuel Gal in 1979. In this zero-sum game, a Hider picks a point to hide on the tree and a Searcher picks... 详细信息
来源: 评论
Refinable modeling for unbinned SMEFT analyses
收藏 引用
MACHINE LEARNING-SCIENCE AND TECHNOLOGY 2025年 第1期6卷
作者: Schoefbeck, Robert Austrian Acad Sci Inst High Energy Phys Dominikanerbastei 16 A-1010 Vienna Austria Tech Univ Wien Karlspl 13 A-1040 Vienna Austria
We present methods to estimate systematic uncertainties in unbinned large hadron collider (LHC) data analyses, focusing on constraining Wilson coefficients in the standard model effective field theory (SMEFT). Our app... 详细信息
来源: 评论
Optimizing the impact toughness of PLA materials using machine learning algorithms
收藏 引用
MATERIALS TODAY COMMUNICATIONS 2025年 44卷
作者: Chen, Yizhuo Zou, Wei Wang, Guanghong Zhang, Chongtian Zhang, Chenglong Jiangsu Normal Univ JSNU SPBPU Inst Engn Russian Inst 101 Shanghai Rd Xuzhou 221116 Jiangsu Peoples R China Jiangsu Normal Univ Sino Russian Inst 101 Shanghai Rd Xuzhou 221116 Jiangsu Peoples R China Jiangsu Normal Univ Sch Mechatron Engn 101 Shanghai Rd Xuzhou 221116 Jiangsu Peoples R China Harbin Inst Technol Weihai Dept Mech Engn Weihai 264209 Peoples R China
This study investigates the influence of various printing parameters on the impact toughness of PLA products, utilizing small sample data and machine learning algorithms to expedite the identification of optimal tough... 详细信息
来源: 评论