咨询与建议

限定检索结果

文献类型

  • 13 篇 期刊文献
  • 1 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 12 篇 工学
    • 11 篇 计算机科学与技术...
    • 2 篇 电气工程
    • 2 篇 信息与通信工程
    • 1 篇 电子科学与技术(可...
    • 1 篇 软件工程
  • 3 篇 理学
    • 3 篇 数学
  • 2 篇 管理学
    • 2 篇 管理科学与工程(可...

主题

  • 14 篇 design of algori...
  • 3 篇 combinatorial pr...
  • 2 篇 towers of hanoi
  • 2 篇 analysis of algo...
  • 2 篇 recursive formul...
  • 2 篇 combinatorial ex...
  • 2 篇 dynamic programm...
  • 1 篇 fuzzy independen...
  • 1 篇 permutation grap...
  • 1 篇 connected compon...
  • 1 篇 access category
  • 1 篇 alpha matting
  • 1 篇 snow
  • 1 篇 maximum independ...
  • 1 篇 computational co...
  • 1 篇 generalized patt...
  • 1 篇 enhanced inserti...
  • 1 篇 maximum flows
  • 1 篇 video
  • 1 篇 sorting

机构

  • 1 篇 vidyasagar univ ...
  • 1 篇 natl taiwan univ...
  • 1 篇 univ florence de...
  • 1 篇 hashemite univ d...
  • 1 篇 georgia inst tec...
  • 1 篇 indian inst mana...
  • 1 篇 univ paris 07 de...
  • 1 篇 nanjing univ sta...
  • 1 篇 univ loughboroug...
  • 1 篇 hung kuang inst ...
  • 1 篇 bar ilan univ de...
  • 1 篇 indian inst mana...
  • 1 篇 natl chiao tung ...
  • 1 篇 kyoto univ kyoto...
  • 1 篇 shanghai jiao to...
  • 1 篇 zhejiang univ te...
  • 1 篇 univ montpellier...
  • 1 篇 maharishi int un...
  • 1 篇 e china univ sci...
  • 1 篇 univ jordan dept...

作者

  • 2 篇 sarkar uk
  • 1 篇 ma lizhuang
  • 1 篇 pinotti cristina...
  • 1 篇 yang shuang-hua
  • 1 篇 ravelomanana vla...
  • 1 篇 wu teng-cao
  • 1 篇 giorgi pascal
  • 1 篇 fujito t
  • 1 篇 bao yanxia
  • 1 篇 watanabe t
  • 1 篇 lewenstein m
  • 1 篇 wang wan-liang
  • 1 篇 altarawneh muhyi...
  • 1 篇 amir a
  • 1 篇 shen yang
  • 1 篇 nagamochi h
  • 1 篇 raut sreenanda
  • 1 篇 alogaily ahmad
  • 1 篇 chen gh
  • 1 篇 tseng ss

语言

  • 13 篇 英文
  • 1 篇 其他
检索条件"主题词=Design of algorithm"
14 条 记 录,以下是11-20 订阅
排序:
Real scaled matching
收藏 引用
INFORMATION PROCESSING LETTERS 1999年 第4期70卷 185-190页
作者: Amir, A Butman, A Lewenstein, M Georgia Inst Technol Coll Comp Atlanta GA 30332 USA Bar Ilan Univ Dept Comp Sci IL-52900 Ramat Gan Israel
Scaled matching refers to the problem of finding all locations in the text where the pattern, proportionally enlarged according to an arbitrary integral scale, appears. Scaled matching is an important problem that was... 详细信息
来源: 评论
On approximation of the submodular set cover problem
收藏 引用
OPERATIONS RESEARCH LETTERS 1999年 第4期25卷 169-174页
作者: Fujito, T Nagoya Univ Dept Elect Nagoya Aichi 4648603 Japan
We design a primal-dural heuristic for the submodular set cover problem and analyze its performance giving an approximation bound as a generalization of the one for the set cover problem. As an application, a capacita... 详细信息
来源: 评论
COMPUTING K-EDGE-CONNECTED COMPONENTS OF A MULTIGRAPH
收藏 引用
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 1993年 第4期E76A卷 513-517页
作者: NAGAMOCHI, H WATANABE, T Kyoto Univ Kyoto-shi Japan
In this paper, we propose an algorithm of O(Absolute value of V min{k, Absolute value of V, square-root Absolute value of A} Absolute value of A time complexity for finding all k-edge-connected components of a given d... 详细信息
来源: 评论
THE WEIGHTED MAXIMUM INDEPENDENT SET PROBLEM IN PERMUTATION GRAPHS
收藏 引用
BIT NUMERICAL MATHEMATICS 1992年 第4期32卷 609-618页
作者: YU, CW CHEN, GH NATL TAIWAN UNIV DEPT COMP SCI & INFORMAT ENGN TAIPEI TAIWAN
In this paper, sequential and parallel algorithms are presented to find a maximum independent set with largest weight in a weighted permutation graph. The sequential algorithm, which is designed based on dynamic progr... 详细信息
来源: 评论