咨询与建议

限定检索结果

文献类型

  • 100 篇 期刊文献
  • 28 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 95 篇 工学
    • 91 篇 计算机科学与技术...
    • 16 篇 软件工程
    • 11 篇 电气工程
    • 6 篇 电子科学与技术(可...
    • 4 篇 信息与通信工程
    • 1 篇 仪器科学与技术
    • 1 篇 生物工程
    • 1 篇 网络空间安全
  • 65 篇 理学
    • 63 篇 数学
    • 2 篇 统计学(可授理学、...
    • 1 篇 化学
    • 1 篇 生物学
  • 8 篇 管理学
    • 8 篇 管理科学与工程(可...
    • 1 篇 工商管理
  • 2 篇 法学
    • 1 篇 法学
    • 1 篇 社会学
  • 1 篇 经济学
    • 1 篇 应用经济学
  • 1 篇 教育学
    • 1 篇 教育学
  • 1 篇 文学
    • 1 篇 新闻传播学
  • 1 篇 医学
    • 1 篇 临床医学

主题

  • 128 篇 design and analy...
  • 19 篇 pattern matching
  • 14 篇 combinatorial al...
  • 8 篇 approximation al...
  • 7 篇 parallel algorit...
  • 6 篇 pattern discover...
  • 6 篇 computational ge...
  • 6 篇 pattern matching...
  • 6 篇 nonstandard patt...
  • 5 篇 dynamic programm...
  • 4 篇 string matching
  • 4 篇 interval graphs
  • 4 篇 intersection gra...
  • 4 篇 permutation grap...
  • 3 篇 irredundant moti...
  • 3 篇 theory of comput...
  • 3 篇 graph algorithms
  • 3 篇 hamming distance
  • 3 篇 subtree isomorph...
  • 3 篇 algorithms

机构

  • 8 篇 bar ilan univ de...
  • 5 篇 bar ilan univ de...
  • 5 篇 natl cheng kung ...
  • 5 篇 toyohashi univ t...
  • 4 篇 georgia inst tec...
  • 4 篇 georgia inst tec...
  • 4 篇 georgia inst tec...
  • 4 篇 kushiro natl col...
  • 3 篇 tel aviv univ sa...
  • 3 篇 vidyasagar univ ...
  • 3 篇 univ haifa dept ...
  • 3 篇 natl cheng kung ...
  • 3 篇 ibm corp thomas ...
  • 3 篇 kushiro natl col...
  • 3 篇 purdue univ dept...
  • 2 篇 vidyasagar univ ...
  • 2 篇 univ tsukuba dep...
  • 2 篇 univ padua dipar...
  • 2 篇 tech univ catalo...
  • 2 篇 univ salerno dip...

作者

  • 9 篇 lewenstein m
  • 8 篇 amir a
  • 8 篇 hsieh sun-yuan
  • 8 篇 apostolico alber...
  • 7 篇 faro simone
  • 6 篇 apostolico a
  • 6 篇 pal madhumangal
  • 5 篇 masuyama shigeru
  • 5 篇 cantone domenico
  • 5 篇 porat e
  • 5 篇 honma hirotoshi
  • 4 篇 nakajima yoko
  • 4 篇 pal m
  • 4 篇 amir amihood
  • 3 篇 kaplan h
  • 3 篇 giaquinta emanue...
  • 3 篇 shamir r
  • 3 篇 tagliacollo clau...
  • 3 篇 porat ely
  • 3 篇 landau gm

语言

  • 109 篇 英文
  • 19 篇 其他
检索条件"主题词=Design and Analysis of Algorithms"
128 条 记 录,以下是1-10 订阅
排序:
A new ACM/ICPC-based teaching reform and exploration of "design and analysis of algorithms"
A new ACM/ICPC-based teaching reform and exploration of "Des...
收藏 引用
5th International Symposium on IT in Medicine and Education, ITME 2013
作者: Zheng, Yunping Sarem, Mudar School of Computer Science and Engineering South China University of Technology 510006 Guangzhou China School of Software Engineering Huazhong University of Science and Technology 430074 Wuhan China
The ACM/ICPC (ACM International Collegiate Programming Contest) is famous as the world's largest and highest level of international collegiate programming contest. In this paper, by considering some problems of th... 详细信息
来源: 评论
On efficient algorithms for bottleneck path problems with many sources
收藏 引用
OPTIMIZATION LETTERS 2024年 第5期18卷 1273-1283页
作者: Kaymakov, Kirill V. Malyshev, Dmitry S. Coleman Tech LLC 40 Mira Ave Moscow 129090 Russia Natl Res Univ Higher Sch Econ Lab Algorithms & Technol Networks Anal 136 Rodionova Str Nizhnii Novgorod 603093 Russia
For given edge-capacitated connected graph and two its vertices s and t, the bottleneck (or maxmin\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \use... 详细信息
来源: 评论
Dynamic Convex Hulls for Simple Paths
收藏 引用
DISCRETE & COMPUTATIONAL GEOMETRY 2025年 1-36页
作者: Brewer, Bruce Brodal, Gerth Stolting Wang, Haitao Univ Utah Kahlert Sch Comp Salt Lake City UT 84112 USA Aarhus Univ Dept Comp Sci Aabogade 34 DK-8200 Aarhus N Denmark
We consider the planar dynamic convex hull problem. In the literature, solutions exist supporting the insertion and deletion of points in poly-logarithmic time and various queries on the convex hull of the current set... 详细信息
来源: 评论
On the Longest Common Cartesian Substring Problem
收藏 引用
COMPUTER JOURNAL 2023年 第4期66卷 907-923页
作者: Faro, Simone Lecroq, Thierry Park, Kunsoo Scafiti, Stefano Univ Catania Dept Math & Comp Sci Catania Italy Normandie Univ UNIROUEN LITIS F-76000 Rouen France Seoul Natl Univ Seoul South Korea
A Cartesian tree is associated with a string of numbers and is structured as a heap from which the original string can be recovered. Although Cartesian trees have been introduced 40 years ago, the Cartesian tree match... 详细信息
来源: 评论
A weak approach to suffix automata simulation for exact and approximate string matching
收藏 引用
THEORETICAL COMPUTER SCIENCE 2022年 933卷 88-103页
作者: Faro, Simone Scafiti, Stefano Univ Catania Dept Math & Comp Sci Viale A Doria 6 I-95125 Catania Italy
String matching is one of the most extensively studied problems in computer science, mainly due to its direct applications to such diverse areas as text, image and signal processing, speech analysis and recognition, i... 详细信息
来源: 评论
Poster: Modified Dynamic Beta RED - A New AQM Algorithm for Internet Congestion Control  23
Poster: Modified Dynamic Beta RED - A New AQM Algorithm for ...
收藏 引用
ACM on Internet Measurement Conference (IMC)
作者: Gimenez, Angel Bonastre, Oscar M. Valero, Jose Amigo, Jose M. Miguel Hernandez Univ Elche Spain
In this work we present a performance study of modified Dynamic Beta RED (mDBetaRED), a new Active Queue Management (AQM) RED-type algorithm based on dynamical variants with the ability to adapt to the characteristics... 详细信息
来源: 评论
Repetitive Processes and Their Surrogate-Model Congruent Encoding for Evolutionary algorithms - A Theoretic Proposal
Repetitive Processes and Their Surrogate-Model Congruent Enc...
收藏 引用
Genetic and Evolutionary Computation Conference (GECCO)
作者: Plump, Christina Berger, Bernhard J. Drechsler, Rolf DFKI Cyber Phys Syst Bremen Germany Hamburg Univ Technol Inst Embedded Syst Hamburg Germany Univ Bremen Dept Math Bremen Germany Univ Bremen Dept Comp Sci Bremen Germany
Evolutionary algorithms are a well-known optimisation technique. They can handle very different optimisation tasks and deal with distorted search spaces as well as non-differentiable optimisation functions. One crucia... 详细信息
来源: 评论
Improved Lion Optimization Algorithm for Wavelet Threshold Method in Ground-Borehole Transient Electromagnetic Signal Processing  24
Improved Lion Optimization Algorithm for Wavelet Threshold M...
收藏 引用
6th International Conference on Telecommunications and Communication Engineering
作者: Yang, Shuai Cao, Hui Song, Wenxu Chengdu Univ Technol Sch Mech & Elect Engn Chengdu Sichuan Peoples R China Chengdu Univ Technol Sch Geophys Chengdu Sichuan Peoples R China
This paper proposes a wavelet denoising algorithm based on an improved lion optimization threshold strategy. By introducing weight and adjustment factors into the standard lion optimization algorithm, the local and gl... 详细信息
来源: 评论
Revealing the Inner Dynamics of Evolutionary algorithms with Convection Selection
Revealing the Inner Dynamics of Evolutionary Algorithms with...
收藏 引用
Genetic and Evolutionary Computation Conference (GECCO)
作者: Komosinski, Maciej Miazga, Konrad Poznan Univ Tech Inst Comp Sci Poznan Poland
Evolutionary algorithms are stochastic algorithms so they tend to find different solutions when run repeatedly. However, it is not just the solutions that vary - the very dynamics of the search that led to finding the... 详细信息
来源: 评论
The Clustered Selected-Internal Steiner Tree Problem
收藏 引用
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE 2022年 第1期33卷 55-66页
作者: Chen, Yen Hung Univ Taipei Dept Comp Sci 1 Ai Guo West Rd Taipei 100234 Taiwan
Given a complete graph G = (V,E), with nonnegative edge costs, two subsets R subset of V and R'subset of R, a partition R = {R-1,R-2, ... ,R-k} of R, R-i boolean AND R-j = phi, i not equal j and Script capital R&#... 详细信息
来源: 评论