咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

  • 13 篇 工学
    • 12 篇 计算机科学与技术...
    • 3 篇 电气工程
    • 3 篇 软件工程
    • 2 篇 控制科学与工程
    • 1 篇 信息与通信工程
  • 10 篇 理学
    • 7 篇 数学
    • 2 篇 系统科学
    • 1 篇 物理学
    • 1 篇 生物学
    • 1 篇 统计学(可授理学、...
  • 3 篇 管理学
    • 3 篇 管理科学与工程(可...
    • 1 篇 工商管理
  • 1 篇 经济学
    • 1 篇 应用经济学
  • 1 篇 法学
    • 1 篇 法学
  • 1 篇 农学
    • 1 篇 作物学
    • 1 篇 农业资源与环境

主题

  • 18 篇 branching algori...
  • 2 篇 network connecti...
  • 2 篇 graph algorithms
  • 2 篇 np-hard problem
  • 2 篇 all-terminal rel...
  • 1 篇 multi-objective ...
  • 1 篇 simulating
  • 1 篇 fixed-parameter ...
  • 1 篇 equivalence
  • 1 篇 improvement fact...
  • 1 篇 monte carlo appr...
  • 1 篇 s-club
  • 1 篇 space lower boun...
  • 1 篇 graph problem
  • 1 篇 new classes
  • 1 篇 split graphs
  • 1 篇 kernelization
  • 1 篇 discrete optimiz...
  • 1 篇 approximation sc...
  • 1 篇 abstract convex ...

机构

  • 1 篇 basque res & tec...
  • 1 篇 univ warsaw inst...
  • 1 篇 tech univ berlin...
  • 1 篇 royal holloway u...
  • 1 篇 department of co...
  • 1 篇 univ rostock ins...
  • 1 篇 univ lorraine la...
  • 1 篇 changsha univ sc...
  • 1 篇 univ waterloo de...
  • 1 篇 rhein westfal th...
  • 1 篇 indian inst tech...
  • 1 篇 arobot innovat n...
  • 1 篇 univ queensland ...
  • 1 篇 ctr ecol & hydro...
  • 1 篇 saarland univ ec...
  • 1 篇 univ london impe...
  • 1 篇 florida int univ...
  • 1 篇 univ jena inst i...
  • 1 篇 univ bonn dept c...
  • 1 篇 changsha univ sc...

作者

  • 2 篇 li wenjun
  • 2 篇 komusiewicz chri...
  • 1 篇 jayabalan v
  • 1 篇 pilipczuk marcin
  • 1 篇 le van bang
  • 1 篇 heggernes pinar
  • 1 篇 rodionova olga
  • 1 篇 seino k
  • 1 篇 drummond peter d...
  • 1 篇 escoffier bruno
  • 1 篇 smith dm
  • 1 篇 reidl felix
  • 1 篇 schaefer alexand...
  • 1 篇 kratsch dieter
  • 1 篇 chen li-hsuan
  • 1 篇 crisan d
  • 1 篇 corney joel f.
  • 1 篇 andramonov m. yu...
  • 1 篇 rodionov alexey
  • 1 篇 tourniaire emeri...

语言

  • 16 篇 英文
  • 2 篇 其他
检索条件"主题词=branching algorithm"
18 条 记 录,以下是11-20 订阅
排序:
Enumerating minimal dominating sets in chordal graphs
收藏 引用
INFORMATION PROCESSING LETTERS 2016年 第12期116卷 739-743页
作者: Abu-Khzam, Faisal N. Heggernes, Pinar Lebanese Amer Univ Dept Comp Sci & Math Beirut Lebanon Charles Darwin Univ Sch Engn & Informat Technol Darwin NT 0909 Australia Univ Bergen Dept Informat N-5020 Bergen Norway
The maximum number of minimal dominating sets in a chordal graph on n vertices is known to be at most 1.6181(n). However, no example of a chordal graph with more than 1.4422(n) minimal dominating sets is known. In thi... 详细信息
来源: 评论
Monte Carlo techniques for real-time quantum dynamics
收藏 引用
JOURNAL OF COMPUTATIONAL PHYSICS 2007年 第2期220卷 549-567页
作者: Dowling, Mark R. Davis, Matthew J. Drummond, Peter D. Corney, Joel F. Univ Queensland Dept Phys Sch Phys Sci ARC Ctr Excellence Quantum Atom Opt Brisbane Qld 4072 Australia
The stochastic-gauge representation is a method of mapping the equation of motion for the quantum mechanical density operator onto a set of equivalent stochastic differential equations. One of the stochastic variables... 详细信息
来源: 评论
Cumulative Update of All-Terminal Reliability for Faster Feasibility Decision
收藏 引用
IEEE TRANSACTIONS ON RELIABILITY 2010年 第3期59卷 551-562页
作者: Won, Jin-Myung Karray, Fakhri Voice Enabling Syst Technol Inc Dept Software Dev Waterloo ON N2L 3L2 Canada Univ Waterloo Dept Elect & Comp Engn Waterloo ON N2L 3G1 Canada
Designing a reliable network becomes a time-consuming task if it involves All-Terminal Reliability (ATR) calculation, which belongs to the class of NP-hard problems. To make this task easier to address, we propose a n... 详细信息
来源: 评论
Improvements in the Efficiency of Cumulative Updating of All-Terminal Network Reliability
收藏 引用
IEEE TRANSACTIONS ON RELIABILITY 2012年 第2期61卷 460-465页
作者: Rodionov, Alexey Migov, Denis Rodionova, Olga Inst Computat Math & Math Geophys Modeling Dynam Proc Informat Networks Lab Novosibirsk 630090 Russia Siberian Univ Consumer Cooperat Novosibirsk 630087 Russia
This paper contains some algorithms and recommendations that enable increasing efficiency of cumulative updating of all-terminal reliability for a network with unreliable links. The existence of cutnodes, 2-node cuts,... 详细信息
来源: 评论
Convergence of a numerical abstract convexity algorithm
收藏 引用
IZVESTIYA MATHEMATICS 2009年 第1期73卷 3-19页
作者: Andramonov, M. Yu. St Petersburg State Univ Dept Appl Math & Control Proc St Petersburg Russia
We propose a series of algorithms for solving abstract convex programming problems and prove convergence to the global solution of the problem. The algorithms use an approximation of the objective function by piecewis... 详细信息
来源: 评论
THE EXTENDED EQUIVALENCE PROBLEM FOR A CLASS OF NON-REAL-TIME DETERMINISTIC PUSHDOWN-AUTOMATA
收藏 引用
ACTA INFORMATICA 1995年 第4期32卷 395-413页
作者: TOMITA, E SEINO, K Department of Communications and Systems Engineering The University of Electro-Communications Chofu Tokyo Japan
We propose a new class of non-real-time deterministic pushdown automata (dpda's), named dpda's having the weak segmental property (WSP), and show that the equivalence problem is solvable for two dpda's, on... 详细信息
来源: 评论
Width, Depth, and Space: Tradeoffs between branching and Dynamic Programming
收藏 引用
algorithmS 2018年 第7期11卷 98-98页
作者: Chen, Li-Hsuan Reidl, Felix Rossmanith, Peter Sanchez Villaamil, Fernando AROBOT Innovat New Taipei Taiwan Royal Holloway Univ London Egham TW20 0EX Surrey England Rhein Westfal TH Aachen Dept Comp Sci D-52062 Aachen Germany
Treedepth is a well-established width measure which has recently seen a resurgence of interest. Since graphs of bounded treedepth are more restricted than graphs of bounded treeor pathwidth, we are interested in the a... 详细信息
来源: 评论
Solving the multi-objective Hamiltonian cycle problem using a Branch-and-Fix based algorithm
收藏 引用
JOURNAL OF COMPUTATIONAL SCIENCE 2022年 第0期60卷
作者: Murua, M. Galar, D. Santana, R. Basque Res & Technol Alliance BRTA TECNALIA Mikeletegi Pasealekua 7 Donostia San Sebastian 20009 Spain Lulea Univ Technol Div Operat & Maintenance Engn S-91787 Lulea Sweden Univ Basque Country UPV EHU Comp Sci & Artificial Intelligence Dept Lardizabal Pasealekua 1 Donostia San Sebastian 20018 Spain
The Hamiltonian cycle problem consists of finding a cycle in a given graph that passes through every single vertex exactly once, or determining that this cannot be achieved. In this investigation, a graph is considere... 详细信息
来源: 评论