咨询与建议

限定检索结果

文献类型

  • 3 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

  • 3 篇 工学
    • 3 篇 计算机科学与技术...
    • 2 篇 软件工程
  • 1 篇 理学
    • 1 篇 数学

主题

  • 3 篇 search tree algo...
  • 1 篇 np-hard problems
  • 1 篇 exact algorithms
  • 1 篇 parallel branch-...
  • 1 篇 heterogeneous di...
  • 1 篇 hitting set prob...
  • 1 篇 algorithm engine...
  • 1 篇 graph modificati...
  • 1 篇 parameterized al...
  • 1 篇 automated develo...
  • 1 篇 autonomic comput...
  • 1 篇 self-configuring...

机构

  • 1 篇 inst super engn ...
  • 1 篇 univ tubingen d-...
  • 1 篇 lusofona univ co...
  • 1 篇 univ fed flumine...
  • 1 篇 univ trier fb ab...
  • 1 篇 inst super engn ...
  • 1 篇 univ hertfordshi...
  • 1 篇 univ tubingen wi...

作者

  • 1 篇 guo j
  • 1 篇 niedermeier r
  • 1 篇 rebello vinod e....
  • 1 篇 hüffner f
  • 1 篇 gramm j
  • 1 篇 fernau henning
  • 1 篇 passos fernanda ...

语言

  • 3 篇 英文
检索条件"主题词=search tree algorithms"
3 条 记 录,以下是1-10 订阅
排序:
Automated generation of search tree algorithms for hard graph modification problems
收藏 引用
ALGORITHMICA 2004年 第4期39卷 321-347页
作者: Gramm, J Guo, J Hüffner, F Niedermeier, R Univ Tubingen Wilhelm Schickard Inst Informat D-72076 Tubingen Germany
We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is twofold-rapid development and improved upper bounds. Many search tree algorithms ... 详细信息
来源: 评论
An autonomic parallel strategy for exhaustive search tree algorithms on shared or heterogeneous systems
收藏 引用
CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2024年 第6期36卷 e7955-e7955页
作者: Passos, Fernanda G. O. Rebello, Vinod E. F. Inst Super Engn Lisboa Dept Elect Telecommun & Comp Engn Lisbon Portugal Lusofona Univ COPELABS Lisbon Portugal Univ Fed Fluminense Dept Comp Sci Niteroi RJ Brazil Inst Super Engn Lisboa ISEL Dept Elect & Telecommun & Comp Engn R Conselheiro Emidio Navarro 1 P-1959007 Lisbon Portugal
Backtracking branch-and-prune (BP) algorithms and their variants are exhaustive search tree techniques widely employed to solve optimization problems in many scientific areas. However, they characteristically often de... 详细信息
来源: 评论
Parameterized algorithms for d-HITTING SET: The weighted case
收藏 引用
THEORETICAL COMPUTER SCIENCE 2010年 第16-18期411卷 1698-1713页
作者: Fernau, Henning Univ Trier FB Abt Informat 4 D-54286 Trier Germany Univ Tubingen D-72074 Tubingen Germany Univ Hertfordshire Hatfield AL10 9AB Herts England
We are going to analyze search tree algorithms for WEIGHTED d-HITTING SET. Although the algorithms that we develop are fairly simple, their analysis is technically involved. We compare the weighted case with the previ... 详细信息
来源: 评论