Results 31 to 40 of about 601,117 (314)

Multiple instance learning tracking method with local sparse representation

open access: yesIET Computer Vision, 2013
When objects undergo large pose change, illumination variation or partial occlusion, most existed visual tracking algorithms tend to drift away from targets and even fail in tracking them.
Chengjun Xie   +4 more
doaj   +1 more source

Virtual Network Embedding Algorithm for Location-Based Identifier Allocation

open access: yesIEEE Access, 2019
Network virtualization allows multiple isolated virtual networks (VNs) to share the same substrate network (SN). VN embedding (VNE) algorithms can efficiently allocate the limited SN resources to VNs and assign a unique identifier to each VN.
Tianjiao Chen   +4 more
doaj   +1 more source

Generalized reordering buffer management [PDF]

open access: yes, 2014
An instance of the generalized reordering buffer management problem consists of a service station that has k servers, each configured with a color, and a buffer of size b. The station needs to serve an online stream of colored items.
Yossi Azar   +7 more
core   +1 more source

Online Batch Scheduling of Simple Linear Deteriorating Jobs with Incompatible Families

open access: yesMathematics, 2020
We considered the online scheduling problem of simple linear deteriorating job families on m parallel batch machines to minimize the makespan, where the batch capacity is unbounded.
Wenhua Li   +3 more
doaj   +1 more source

An Online Algorithm for Smoothed Online Convex Optimization [PDF]

open access: yesACM SIGMETRICS Performance Evaluation Review, 2019
We consider Online Convex Optimization (OCO) in the setting where the costs are m-strongly convex and the online learner pays a switching cost for changing decisions between rounds. We show that the recently proposed Online Balanced Descent (OBD) algorithm is constant competitive in this setting, with competitive ratio 3+O(1/m), irrespective of the ...
Goel, Gautam, Wierman, Adam
openaire   +2 more sources

Backup or Not: An Online Cost Optimal Algorithm for Data Analysis Jobs Using Spot Instances

open access: yesIEEE Access, 2020
Recently, large-scale public cloud providers begin to offer spot instances. This type of instance has become popular with more and more cloud users in the light of its convenient access mode and low price, especially for those big data analysis jobs with
Liduo Lin, Li Pan, Shijun Liu
doaj   +1 more source

Adaptive Virtual RSU Scheduling for Scalable Coverage under Bidirectional Vehicle Traffic Flow

open access: yesAlgorithms, 2017
Over the past decades, vehicular ad hoc networks (VANETs) have been a core networking technology to provide drivers and passengers with safety and convenience.
Fei Chen   +5 more
doaj   +1 more source

Balanced Parallel Exploration of Orthogonal Regions

open access: yesAlgorithms, 2019
We consider the use of multiple mobile agents to explore an unknown area. The area is orthogonal, such that all perimeter lines run both vertically and horizontally.
Wyatt Clements   +4 more
doaj   +1 more source

Online algorithms for market clearing

open access: yesJournal of the ACM, 2006
In this article, we study the problem of online market clearing where there is one commodity in the market being bought and sold by multiple buyers and sellers whose bids arrive and expire at different times. The auctioneer is faced with an online clearing problem of deciding which buy and sell bids to match without knowing what bids will ...
Avrim Blum   +2 more
openaire   +2 more sources

Online Graph Algorithms with Predictions [PDF]

open access: yes, 2022
Online algorithms with predictions is a popular and elegant framework for bypassing pessimistic lower bounds in competitive analysis. In this model, online algorithms are supplied with future predictions, and the goal is for the competitive ratio to smoothly interpolate between the best offline and online bounds as a function of the prediction error ...
Yossi Azar   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy