咨询与建议

限定检索结果

文献类型

  • 234 篇 期刊文献
  • 30 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 220 篇 工学
    • 210 篇 计算机科学与技术...
    • 43 篇 软件工程
    • 19 篇 电气工程
    • 10 篇 控制科学与工程
    • 6 篇 机械工程
    • 5 篇 信息与通信工程
    • 4 篇 电子科学与技术(可...
    • 1 篇 仪器科学与技术
    • 1 篇 航空宇航科学与技...
  • 106 篇 理学
    • 103 篇 数学
    • 1 篇 物理学
  • 32 篇 管理学
    • 32 篇 管理科学与工程(可...
    • 3 篇 工商管理
  • 4 篇 经济学
    • 3 篇 应用经济学

主题

  • 264 篇 on-line algorith...
  • 77 篇 competitive anal...
  • 33 篇 scheduling
  • 24 篇 analysis of algo...
  • 14 篇 computational ge...
  • 13 篇 paging
  • 13 篇 randomized algor...
  • 12 篇 approximation al...
  • 12 篇 competitive rati...
  • 7 篇 load balancing
  • 7 篇 algorithms
  • 7 篇 competitiveness
  • 7 篇 combinatorial pr...
  • 6 篇 routing
  • 6 篇 bin packing
  • 6 篇 resource allocat...
  • 5 篇 k-server problem
  • 5 篇 computer arithme...
  • 5 篇 data structures
  • 5 篇 lookahead

机构

  • 10 篇 technion israel ...
  • 8 篇 univ hong kong d...
  • 7 篇 tel aviv univ de...
  • 6 篇 max planck inst ...
  • 5 篇 univ haifa dept ...
  • 3 篇 univ calif river...
  • 3 篇 cuny brooklyn co...
  • 3 篇 univ so denmark ...
  • 3 篇 tohoku univ grad...
  • 3 篇 univ calif santa...
  • 3 篇 univ calif san d...
  • 3 篇 univ kaiserslaut...
  • 3 篇 univ zagreb dept...
  • 3 篇 graz tech univ i...
  • 2 篇 technion israel ...
  • 2 篇 int comp sci ins...
  • 2 篇 pusan natl forei...
  • 2 篇 univ karlsruhe f...
  • 2 篇 univ rome la sap...
  • 2 篇 univ calif berke...

作者

  • 9 篇 azar y
  • 7 篇 epstein l
  • 7 篇 leonardi s
  • 7 篇 zhang yong
  • 6 篇 larsen ks
  • 5 篇 albers s
  • 5 篇 bar-noy a
  • 4 篇 marchetti-spacca...
  • 4 篇 boyar j
  • 4 篇 feuerstein e
  • 4 篇 fiat a
  • 4 篇 noga j
  • 4 篇 woeginger gj
  • 3 篇 kotov v
  • 3 篇 moruz gabriel
  • 3 篇 escoffier bruno
  • 3 篇 regev o
  • 3 篇 deng xt
  • 3 篇 xu weijun
  • 3 篇 bonifaci vincenz...

语言

  • 237 篇 英文
  • 27 篇 其他
检索条件"主题词=On-line algorithms"
264 条 记 录,以下是81-90 订阅
排序:
A simpler competitive analysis for scheduling equal-length jobs on one machine with restarts
收藏 引用
INFORMATION PROCESSING LETTERS 2008年 第6期107卷 240-245页
作者: Goldwasser, Michael H. Misra, Arundhati Bagchi St Louis Univ Dept Math & Comp Sci St Louis MO 63103 USA Mississippi State Univ Dept Math & Stat Mississippi State MS 39762 USA
We consider the online problem of scheduling jobs with equal processing times on a single machine. Each job has a release time and a deadline, and the goal is to maximize the number of jobs completed by their deadline... 详细信息
来源: 评论
A note on the online First-Fit algorithm for coloring k-inductive graphs
收藏 引用
INFORMATION PROCESSING LETTERS 2008年 第1期109卷 44-45页
作者: Smorodinsky, Shakhar Ben Gurion Univ Negev Dept Math IL-84105 Beer Sheva Israel
In a FOCS 1990 paper, S. Irani proved that the First-Fit online algorithm for coloring a graph uses at most O(k log n) colors for k-inductive graphs. In this note we provide a very short proof of this fact. (C) 2008 E... 详细信息
来源: 评论
Online chasing problems for regular polygons
收藏 引用
INFORMATION PROCESSING LETTERS 2008年 第3期108卷 155-159页
作者: Fujiwara, Hiroshi Iwama, Kazuo Yonezawa, Kouki Kwansei Gakuin Univ Dept Informat Sanda 6691337 Japan Kyoto Univ Sch Informat Kyoto 6068501 Japan Hokkaido Univ Meme Media Lab Kita Ku Sapporo Hokkaido 0608628 Japan
We consider a server location problem with only one server to move. In this paper we assume that a request is given as a region and that the service can be done anywhere inside the region. Namely, for each request an ... 详细信息
来源: 评论
Streaming algorithm for graph spanners - single pass and constant processing time per edge
收藏 引用
INFORMATION PROCESSING LETTERS 2008年 第3期106卷 110-114页
作者: Baswana, Surender Indian Inst Technol Dept Comp Sci & Engn Kanpur 208016 Uttar Pradesh India
The problem of computing spanners of unweighted graphs in streaming model is presented. The streaming model has two characteristics, firstly the input data can be accessed only sequentially in the form of a stream, an... 详细信息
来源: 评论
Sorting streamed multisets
收藏 引用
INFORMATION PROCESSING LETTERS 2008年 第6期108卷 418-421页
作者: Gagie, Travis Univ Piemonte Orientale Dipartimento Informat Alessandria AL Italy
Sorting is a classic problem and one to which many others reduce easily. In the streaming model, however, we are allowed only one pass over the input and sublinear memory, so in general we cannot sort. In this paper w... 详细信息
来源: 评论
Online hypergraph coloring
收藏 引用
INFORMATION PROCESSING LETTERS 2008年 第1期109卷 23-26页
作者: Nagy-Gyorgy, J. Imreh, Cs. Univ Szeged Dept Informat H-6720 Szeged Hungary Univ Szeged Dept Math H-6720 Szeged Hungary
In this paper we investigate the online hypergraph coloring problem. fit this online problem the algorithm receives the vertices of the hypergraph in some order v(1)..... v(n) and it must color vi by only looking at t... 详细信息
来源: 评论
On the power of lookahead in on-line server routing problems
收藏 引用
THEORETICAL COMPUTER SCIENCE 2008年 第2-3期408卷 116-128页
作者: Allulli, Luca Ausiello, Giorgio Bonifaci, Vincenzo Laura, Luigi Univ Roma La Sapienza Dipartimento Informat & Sistemist I-00185 Rome Italy Univ Aquila Dipartimento Ingn Elettr I-67040 Laquila Italy
We study the usefulness of lookahead in on-line server routing problems: if an on-line algorithm is not only informed about the requests released so far, but also has a limited ability to foresee future requests, what... 详细信息
来源: 评论
On the effectiveness of the Harmonic Shelf Algorithm for on-line strip packing
收藏 引用
DISCRETE MATHEMATICS 2008年 第16期308卷 3699-3703页
作者: Caramia, Massimiliano Giordani, Stefano Univ Roma Tor Vergata Dipartimento Ingn Impresa I-00133 Rome Italy
In [J. Csirik, G.J. Woeginger, An on-line algorithm for multidimensional bin packing, Inform. Process. Lett. 63 (1997) 171-175] the authors study the asymptotic worst case ratio between the height of the strip needed ... 详细信息
来源: 评论
A note on the k-Canadian Traveller Problem
收藏 引用
INFORMATION PROCESSING LETTERS 2008年 第3期106卷 87-89页
作者: Westphal, Stephan Univ Kaiserslautern Dept Math D-67653 Kaiserslautern Germany
We consider the online problem k-CTP, which is the problem to guide a vehicle from some site s to some site t on a road map given by a graph G = (V, E) in which up to k (unknown) edges are blocked by avalanches. An on... 详细信息
来源: 评论
The online Prize-Collecting Traveling Salesman Problem
收藏 引用
INFORMATION PROCESSING LETTERS 2008年 第6期107卷 199-204页
作者: Ausiello, Giorgio Bonifaci, Vincenzo Laura, Luigi Univ Roma La Sapienza Dipartimento Informat & Sistemist I-00185 Rome Italy Univ Aquila Dipartimento Ingn Elettr I-67040 Laquila Italy
We study the online version of the Prize-Collecting Traveling Salesman Problem (PCTSP), a generalization of the Traveling Salesman Problem (TSP). In the TSP, the salesman has to visit a set of cities while minimizing ... 详细信息
来源: 评论