咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

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

主题

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

机构

  • 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 订阅
排序:
Point-to-point and multi-goal path planning for industrial robots
收藏 引用
JOURNAL OF ROBOTIC SYSTEMS 2001年 第8期18卷 445-461页
作者: Wurll, C Henrich, D AMATEC Robot GMBH D-82110 Germering Germany Univ Kaiserslautern Fac Informat RESY D-67653 Kaiserslautern Germany
This article presents contributions in the field of path planning for industrial robots with 6 degrees of freedom. This work presents the results of our research in the last 4 years at the Institute for Process Contro... 详细信息
来源: 评论
On-line file caching
收藏 引用
ALGORITHMICA 2002年 第3期33卷 371-383页
作者: Young, NE Dartmouth Coll Hanover NH 03755 USA Akamai Technol Cambridge MA 02138 USA
Consider the following file caching problem: in response to a sequence of requests for files, where each file has a specified size and retrieval cost, maintain a cache of files of total size at most some specified k s... 详细信息
来源: 评论
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... 详细信息
来源: 评论
Competitive deadline scheduling via additional or faster processors
收藏 引用
JOURNAL OF SCHEDULING 2003年 第2期6卷 213-223页
作者: Koo, CY Lam, TW Ngan, TW To, KK Univ Hong Kong Dept Comp Sci Hong Kong Hong Kong Peoples R China
This paper studies on-line scheduling in a single-processor system that allows preemption. The aim is to maximize the total value of jobs completed by their deadlines. It is known that if the on-line scheduler is give... 详细信息
来源: 评论
P2P-FISM: Mining (recently) frequent item sets from distributed data streams over P2P network
收藏 引用
INFORMATION PROCESSING LETTERS 2013年 第19-21期113卷 793-798页
作者: Farzanyar, Zahra Kangavari, Mohammadreza Cercone, Nick Iran Univ Sci & Technol Dept Comp Engn Tehran Iran York Univ Dept Comp Sci & Engn Toronto ON M3J 2R7 Canada
Data intensive large-scale distributed systems like peer-to-peer (P2P) networks are finding large number of applications for social networking, file sharing networks, etc. Global data mining in such P2P environments m... 详细信息
来源: 评论
Buffer overflow management with class segregation
收藏 引用
INFORMATION PROCESSING LETTERS 2013年 第4期113卷 145-150页
作者: Al-Bawani, Kamal Souza, Alexander Rhein Westfal TH Aachen Dept Comp Sci Aachen Germany Humboldt Univ Dept Comp Sci Berlin Germany
We consider a new model for buffer management of network switches with Quality of Service (QoS) requirements. A stream of packets, each attributed with a value representing its Class of Service (CoS), arrives over tim... 详细信息
来源: 评论
Balanced allocations
收藏 引用
SIAM JOURNAL ON COMPUTING 1999年 第1期29卷 180-200页
作者: Azar, Y Broder, AZ Karlin, AR Upfal, E Tel Aviv Univ Dept Comp Sci IL-69978 Tel Aviv Israel Digital Syst Res Ctr Palo Alto CA 94301 USA Univ Washington Dept Comp Sci Seattle WA 98195 USA IBM Corp Almaden Res Ctr San Jose CA 95120 USA Weizmann Inst Sci Dept Appl Math IL-76100 Rehovot Israel
Suppose that we sequentially place n balls into n boxes by putting each ball into a randomly chosen box. It is well known that when we are done, the fullest box has with high probability (1 + o(1)) ln n/ ln ln n balls... 详细信息
来源: 评论
On-line extensible bin packing with unequal bin sizes
收藏 引用
DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE 2009年 第1期11卷 141-152页
作者: Ye, Deshi Zhang, Guochuan Zhejiang Univ Coll Comp Sci Hangzhou 310027 Peoples R China
In the extensible bin packing problem we are asked to pack a set of items into a given number of bins, each with an original size. However, the original bin sizes can be extended if necessary. The goal is to minimize ... 详细信息
来源: 评论
Approximating total flow time on parallel machines
收藏 引用
JOURNAL OF COMPUTER AND SYSTEM SCIENCES 2007年 第6期73卷 875-891页
作者: Leonardi, Stefano Raz, Danny Univ Roma La Sapienza Dipartimento Informat & Sistemist I-00198 Rome Italy Technion Israel Inst Technol Dept Comp Sci IL-32000 Haifa Israel
We consider the problem of optimizing the total flow time of a stream of jobs that are released over time in a multiprocessor setting. This problem is NP-hard even when there are only two machines and preemption is al... 详细信息
来源: 评论
Semi-on-line multiprocessor scheduling with given total processing time
收藏 引用
THEORETICAL COMPUTER SCIENCE 2005年 第1-3期337卷 134-146页
作者: Cheng, TCE Kellerer, H Kotov, V Graz Univ Inst Stat & Operat Res A-8010 Graz Austria Hong Kong Polytech Univ Dept Logist Kowloon Hong Kong Peoples R China Belarusian State Univ Fac Appl Math & Comp Sci Minsk 220050 BELARUS
We are given a set of identical machines and a sequence of jobs, the sum of whose weights is known in advance. The jobs are to be assigned on-line to one of the machines and the objective is to minimize the makespan. ... 详细信息
来源: 评论