Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,227,207 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
2014
2014
Dynamic Transmission Scheduling and Link Selection in Mobile Cloud Computing
Huaming Wu
,
K. Wolter
Analytical and Stochastic Modeling Techniques and…
2014
Corpus ID: 2176797
Recently, mobile devices have multiple wireless interfaces to use, but how to choose an appropriate network interface? Energy…
Expand
2009
2009
Considering physical layer impairments in offline RWA
K. Christodoulopoulos
,
K. Manousakis
,
Emmanouel Varvarigos
,
M. Angelou
IEEE Network
2009
Corpus ID: 6840056
We consider the offline version of the routing and wavelength assignment problem in transparent all-optical networks. In such…
Expand
2008
2008
Efficient reinforcement learning in parameterized models: discrete parameters
K. Dyagilev
,
Shie Mannor
,
N. Shimkin
ValueTools
2008
Corpus ID: 10323898
We consider reinforcement learning in the parameterized setup, where the model is known to belong to a finite set of Markov…
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
1999
1999
Trade-offs between speed and processor in hard-deadline scheduling
T. Lam
,
Kar-Keung 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
1997
1997
A refined class of cost functions in blind equalization
Victor Shtrom
,
H. Fan
IEEE International Conference on Acoustics…
1997
Corpus ID: 7423867
The use of gradient descent recursive algorithms in blind adaptive equalization requires a cost function with a unique minimum…
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