咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

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

主题

  • 129 篇 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

语言

  • 110 篇 英文
  • 19 篇 其他
检索条件"主题词=Design and analysis of algorithms"
129 条 记 录,以下是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... 详细信息
来源: 评论
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... 详细信息
来源: 评论
Overlap matching
收藏 引用
INFORMATION AND COMPUTATION 2003年 第1期181卷 57-74页
作者: Amir, A Cole, R Hariharan, R Lewenstein, M Porat, E IBM Corp Thomas J Watson Res Ctr Yorktown Hts NY 10598 USA Bar Ilan Univ Dept Comp Sci IL-52900 Ramat Gan Israel Georgia Tech Coll Comp Atlanta GA 30332 USA NYU Courant Inst Math Sci Dept Comp Sci New York NY 10012 USA Indian Inst Sci CSA Dept Bangalore 560012 Karnataka India
We propose a new paradigm for string matching, namely structural matching. In structural matching, the text and pattern contents are not important. Rather, some areas in the text and pattern, such as intervals, are si... 详细信息
来源: 评论
The weight-constrained maximum-density subtree problem and related problems in trees
收藏 引用
JOURNAL OF SUPERCOMPUTING 2010年 第3期54卷 366-380页
作者: Hsieh, Sun-Yuan Chou, Ting-Yu Natl Cheng Kung Univ Dept Comp Sci & Informat Engn Tainan 701 Taiwan
Given a tree T = (V, E) of n nodes such that each node v is associated with a value-weight pair (val(v), w(v)), where value val(v) is a real number and weight w(v) is a non-negative integer, the density of T is define... 详细信息
来源: 评论
Optimal semi-online algorithms for machine covering
收藏 引用
THEORETICAL COMPUTER SCIENCE 2007年 第1期372卷 69-80页
作者: Tan, Zhiyi Wu, Yong Zhejiang Univ Dept Math State Key Lab CAD&CG Hangzhou 310027 Peoples R China
This paper investigates the semi-online machine covering problems on m >= 3 parallel identical machines. Three different semi-online versions are studied and optimal algorithms are proposed. We prove that if the to... 详细信息
来源: 评论
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... 详细信息
来源: 评论
Scheduling orders for multiple product types to minimize total weighted completion time
收藏 引用
DISCRETE APPLIED MATHEMATICS 2007年 第8期155卷 945-970页
作者: Leung, Joseph Y. -T. Li, Haibing Pinedo, Michael New Jersey Inst Technol Dept Comp Sci Newark NJ 07102 USA NYU Stern Sch Business New York NY 10012 USA
We consider the problem of scheduling orders for multiple different product types in an environment with in dedicated machines in parallel. The objective is to minimize the total weighted completion time. Each product... 详细信息
来源: 评论
Real Two Dimensional Scaled Matching
收藏 引用
ALGORITHMICA 2009年 第3期53卷 314-336页
作者: Amir, Amihood Butman, Ayelet Lewenstein, Moshe Porat, Ely Bar Ilan Univ Ramat Gan Israel Johns Hopkins Univ Baltimore MD USA Holon Acad Inst Technol Holon Israel
Scaled Matching refers to the problem of finding all locations in the text where the pattern, proportionally enlarged according to an arbitrary real-sized scale, appears. Scaled matching is an important problem that w... 详细信息
来源: 评论
A COMPARATIVE-STUDY OF MULTIPLE ATTRIBUTE TREE AND INVERTED FILE STRUCTURES FOR LARGE BIBLIOGRAPHIC FILES
收藏 引用
INFORMATION PROCESSING & MANAGEMENT 1985年 第5期21卷 433-442页
作者: RAO, SVN IYENGAR, SS MADHAVAN, CEV INDIAN INST SCI SCH AUTOMATBANGALORE 560012KARNATAKAINDIA
A variety of data structures such as inverted file, multi-lists, quad tree, k-d tree, range tree, polygon tree, quintary tree, multidimensional tries, segment tree, doubly chained tree, the grid file, d -fold tree. su... 详细信息
来源: 评论
A PARALLEL ALGORITHM FOR EDGE-COLORING OF GRAPHS WITH EDGE-DISJOINT CYCLES
收藏 引用
INFORMATION PROCESSING LETTERS 1992年 第6期43卷 309-314页
作者: ALBACEA, EA Department of Computer Science Australian National University Canberra ACT 2601 Australia
We present a new linear algorithm for coloring the edges of a tree. Although this is not the first linear algorithm for the problem, our algorithm unlike the existing ones can be parallelized directly. The paralleliza... 详细信息
来源: 评论