Results 1  10
of
4,077
Scheduling with conflicts: online and offline algorithms
, 2009
"... We consider the following problem of scheduling with conflicts (SWC): Find a minimum makespan schedule on identical machines where conflicting jobs cannot be scheduled concurrently. We study the problem when conflicts between jobs are modeled by general graphs. Our first main positive result is an ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
is an exact algorithm for two machines and job sizes in {1, 2}. For jobs sizes in {1, 2, 3}, we can obtain a 4 3approximation, which improves on the 3 2 approximation that was previously known for this case. Our main negative result is that for jobs sizes in {1, 2, 3, 4}, the problem is APXhard. Our second
Persistence, Offline Algorithms, and Space Compaction
, 1991
"... We consider dynamic data structures in which updates rebuild a static solution. Space bounds for persistent versions of these structures can often be reduced by using an offline persistent data structure in place of the static solution. We apply this technique to decomposable search problems, to dyn ..."
Abstract
 Add to MetaCart
We consider dynamic data structures in which updates rebuild a static solution. Space bounds for persistent versions of these structures can often be reduced by using an offline persistent data structure in place of the static solution. We apply this technique to decomposable search problems
Offline Algorithms for Dynamic Minimum Spanning Tree Problems
, 1994
"... We describe an efficient algorithm for maintaining a minimum spanning tree (MST) in a graph subject to a sequence of edge weight modifications. The sequence of minimum spanning trees is computed offline, after the sequence of modifications is known. The algorithm performs O(log n) work per modificat ..."
Abstract

Cited by 18 (9 self)
 Add to MetaCart
We describe an efficient algorithm for maintaining a minimum spanning tree (MST) in a graph subject to a sequence of edge weight modifications. The sequence of minimum spanning trees is computed offline, after the sequence of modifications is known. The algorithm performs O(log n) work per
Online and Offline Handwriting Recognition: A Comprehensive Survey
 IEEE Transactions on Pattern Analysis and Machine Intelligence
"... AbstractÐHandwriting has continued to persist as a means of communication and recording information in daytoday life even with the introduction of new technologies. Given its ubiquity in human transactions, machine recognition of handwriting has practical significance, as in reading handwritten no ..."
Abstract

Cited by 495 (8 self)
 Add to MetaCart
line case (which pertains to the availability of trajectory data during writing) and the offline case (which pertains to scanned images) are considered. Algorithms for preprocessing, character and word recognition, and performance with practical systems are indicated. Other fields of application, like
Offline Algorithms for Several Network Design, Clustering and QoS Optimization Problems
"... In this paper we address several network design, clustering and Quality of Service (QoS) optimization problems and present novel, efficient, offline algorithms which compute optimal or nearoptimal solutions. The QoS optimization problems consist of reliability improvement (by computing backup shor ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In this paper we address several network design, clustering and Quality of Service (QoS) optimization problems and present novel, efficient, offline algorithms which compute optimal or nearoptimal solutions. The QoS optimization problems consist of reliability improvement (by computing backup
Optimal online and offline algorithms for robotassisted restoration of barrier coverage
"... Cooperation between mobile robots and wireless sensor networks is a line of research that is currently attracting a lot of attention. In this context, we study the following problem of barrier coverage by stationary wireless sensors that are assisted by a mobile robot with the capacity to move sens ..."
Abstract
 Add to MetaCart
time offline algorithm that gives a minimumlength trajectory for a robot that starts at one end of the barrier and achieves the restoration of barrier coverage. We also study two different online models: one in which the online robot does not know the length of the barrier in advance, and the other in which
Planning and acting in partially observable stochastic domains
 ARTIFICIAL INTELLIGENCE
, 1998
"... In this paper, we bring techniques from operations research to bear on the problem of choosing optimal actions in partially observable stochastic domains. We begin by introducing the theory of Markov decision processes (mdps) and partially observable mdps (pomdps). We then outline a novel algorithm ..."
Abstract

Cited by 1095 (38 self)
 Add to MetaCart
In this paper, we bring techniques from operations research to bear on the problem of choosing optimal actions in partially observable stochastic domains. We begin by introducing the theory of Markov decision processes (mdps) and partially observable mdps (pomdps). We then outline a novel algorithm
Amortized Efficiency of List Update and Paging Rules
, 1985
"... In this article we study the amortized efficiency of the “movetofront” and similar rules for dynamically maintaining a linear list. Under the assumption that accessing the ith element from the front of the list takes 0(i) time, we show that movetofront is within a constant factor of optimum amo ..."
Abstract

Cited by 824 (8 self)
 Add to MetaCart
paging, a setting in which the access cost is not convex. The paging rule corresponding to movetofront is the “least recently used” (LRU) replacement rule. We analyze the amortized complexity of LRU, showing that its efficiency differs from that of the offline paging rule (Belady’s MIN algorithm) by a
A scheduling model for reduced CPU energy
 ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE
, 1995
"... The energy usage of computer systems is becoming an important consideration, especially for batteryoperated systems. Various methods for reducing energy consumption have been investigated, both at the circuit level and at the operating systems level. In this paper, we propose a simple model of job s ..."
Abstract

Cited by 558 (3 self)
 Add to MetaCart
an offline algorithm that computes, for any set of jobs, a minimumenergy schedule. We then consider some online algorithms and their competitive performance for the power function P(s) = sp where p 3 2. It is shown that one natural heuristic, called the Average Rate heuristic, uses at most a constant
Results 1  10
of
4,077