Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 236,790,411 papers from all fields of science
Search
Sign In
Create Free Account
Online algorithm
Known as:
Online algorithms
, Offline algorithm
, Online problem
Expand
In computer science, an online algorithm is one that can only process its input piece-by-piece in a serial fashion, i.e., in the order that the input…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Adversary model
Algorithm
Algorithms for calculating variance
Amortized analysis
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Managing a cluster of IoT brokers in support of smart city applications
S. Tabatabai
,
Ihab Mohammed
,
Ala Al-Fuqaha
,
M. A. Salahuddin
IEEE International Symposium on Personal, Indoor…
2017
Corpus ID: 3413398
Publish/subscribe brokers enable the efficient dissemination of events to a large number of subscribers in support of smart city…
Expand
2016
2016
Reactive Property Monitoring of Hybrid Systems with Aggregation
Nicolas Rapin
Runtime Verification
2016
Corpus ID: 27424746
This work is related to our monitoring tool called ARTiMon for the property monitoring of hybrid systems. We explain how the…
Expand
2016
2016
Detecting weak changes in dynamic events over networks
Shuang Li
,
Yao Xie
,
Mehrdad Farajtabar
,
Le Song
arXiv.org
2016
Corpus ID: 15769035
Large volume of networked streaming event data are becoming increasingly available in a wide variety of applications, such as…
Expand
2013
2013
Efficient link scheduling for rechargeable wireless ad hoc and sensor networks
Guodong Sun
,
Guofu Qiao
,
Lin Zhao
EURASIP Journal on Wireless Communications and…
2013
Corpus ID: 14331895
We study the link scheduling for rechargeable wireless ad hoc and sensor networks to improve network throughput. Efficient link…
Expand
2008
2008
ZRM Codes
J. Borges
,
C. Fernández-Córdoba
,
K. Phelps
IEEE Transactions on Information Theory
2008
Corpus ID: 12824171
Quaternary ZRM(r,m) codes were defined so that their binary images, via Gray map, are Reed-Muller codes for some specific values…
Expand
2004
2004
Energy-Efficient Packet Processing
Ravi Kokku
,
Upendra Shevade
,
Nishit Shah
,
M. Dahlin
,
H. Vin
2004
Corpus ID: 14266750
Packet processing systems (e.g., routers, virus scanners, intrusion detectors, SSL accelerators, etc.) provision sufficient…
Expand
2004
2004
Optimizing System Life time for Data Gathering in Networked Sensor Systems ∗
Bo Hong
,
V. Prasanna
2004
Corpus ID: 18929673
We focus on data gathering problems in energyconstrained networked sensor systems. The system operates in rounds where a subset…
Expand
1999
1999
Trade-offs between speed and processor in hard-deadline scheduling
T. Lam
,
I. K. To
ACM-SIAM Symposium on Discrete Algorithms
1999
Corpus ID: 14602778
This paper revisits the problem of on-line scheduling of sequential jobs with hard deadlines in a preemptive, multiprocessor…
Expand
1995
1995
A STUDY OF ON-LINE SCHEDULING TWO-STAGE SHOPS·
Bo Chen
,
G. Woeginger
1995
Corpus ID: 60498660
We investigate the problem of on-line scheduling two-stage shops with the objective of minimizing the maximum completion time. We…
Expand
Review
1979
Review
1979
IDENTIFICATION AND MODELING FOR LINEAR MULTIVARIABLE DISCRETE-TIME SYSTEMS: A SURVEY
H. El-Sherief
,
N. Sinha
1979
Corpus ID: 57285993
A survey is presented of the existing literature on the identification of linear multivariable discrete-time systems from input…
Expand