咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

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

主题

  • 2 篇 lookahead algori...
  • 1 篇 graph algorithms
  • 1 篇 sparsification
  • 1 篇 strong connectiv...
  • 1 篇 dynamic algorith...
  • 1 篇 graph certificat...
  • 1 篇 job scheduling
  • 1 篇 transitive closu...
  • 1 篇 online algorithm...

机构

  • 1 篇 sandia natl labs...
  • 1 篇 at&t bell labs d...
  • 1 篇 stanford univ de...
  • 1 篇 coll william & m...

作者

  • 1 篇 motwani r
  • 1 篇 coleman b
  • 1 篇 wilson rh
  • 1 篇 khanna s
  • 1 篇 mao wz

语言

  • 2 篇 英文
检索条件"主题词=lookahead algorithms"
2 条 记 录,以下是1-10 订阅
排序:
On certificates and lookahead in dynamic graph problems
收藏 引用
ALGORITHMICA 1998年 第4期21卷 377-394页
作者: Khanna, S Motwani, R Wilson, RH AT&T Bell Labs Dept Fundamental Math Res Murray Hill NJ 07974 USA Stanford Univ Dept Comp Sci Stanford CA 94305 USA Sandia Natl Labs Intelligent Syst & Robot Ctr Albuquerque NM 87185 USA
Recent work in dynamic graph algorithms has led to efficient algorithms for dynamic undirected graph problems such as connectivity. However, no efficient deterministic algorithms are known for the dynamic versions of ... 详细信息
来源: 评论
lookahead scheduling in a real-time context
Lookahead scheduling in a real-time context
收藏 引用
6th Joint Conference on Information Sciences
作者: Coleman, B Mao, WZ Coll William & Mary Dept Comp Sci Williamsburg VA 23187 USA
The goal of a resource assignment problem is to satisfy a sequence of requests for a limited number of resources. Traditionally, online algorithms have been used to solve these problems, however there has been interes... 详细信息
来源: 评论