Strategies and their evaluations play important roles in speeding up the computation of large smooth-degree isogenies. The concept optimal strategies for such was introduced by De Feo et al., virtually all implementations isogeny-based protocols have adopted this approach, which is provably single-core platforms. In spite its inherent sequential nature, several recent works studied ways isogeny...

The problem of scheduling jobs with precedence constraints is a central problem in Scheduling Theory which arises in many industrial and scientific applications. In this paper we present a polynomial time approximation scheme for the problem of scheduling jobs with chain precedence constraints on a fixed number of uniformly related machines. Our algorithm works even if we allow “slow” machines ...

As the resource constrained project scheduling problem (RCPSP) has a wide range of applications, its models, extensions and algorithms have been intensively studied [2]. As for objective functions, makespan minimization has commonly been used, while the importance of non-regular ones such as earliness-tardiness are also recognized. In this paper, we introduce a time-lag cost, which is charged a...

We consider two general precedence-constrained scheduling problems that have wide applicability in the areas of parallel processing, high performance compiling, and digital system synthesis. These problems are intractable so it is important to be able to compute tight bounds on their solutions. A tight lower bound on makespan scheduling can be obtained by replacing precedence constraints with r...

Abstract: Consider a multi-phase project management problem where the decision maker needs to deal with two issues: (a) how to allocate resources to projects within each phase, and (b) when to enter the next phase, so that the total expected reward is as large as possible. We formulate the problem as a multi-armed bandit problem with precedence relations. In Chan, Fuh and Hu (2005), a class of ...

Test case prioritization is a difficult problem of Software Engineering, since several factors may be considered in order to find the best order for test cases. Search-based techniques have been applied to find solutions for test case prioritization problem. Some of these works apply Ant Colony based algorithms, but the precedence of test cases was not considered. We propose an Ant Colony Optim...

This paper investigates a form of algorithm hybridization that combines constraint satisfaction algorithms with local search algorithms. On one hand, constraint satisfaction algorithms are eeective at nding feasible solutions for tightly constrained problems with complex constraints. On the other hand, local search algorithms are usually better at nding solutions that are good with respect to a...

In this paper, we present a novel framework of multi-rate scheduling of signal processing programs represented by regular stream ow graphs (RSFGs). The main contribution of this paper is translating the scheduling problem of RSFGs into an equivalent problem in the domain of Karp-Miller computation graphs. A distinct feature of our scheduling framework | called multi-rate software pipelining | i...

Abstract. An optimization problem is formulated in the tropical mathematics setting to maximize a nonlinear objective function defined by conjugate transposition on vectors in a semimodule over a general idempotent semifield. The study is motivated by problems from project scheduling, where the deviation between completion times of activities is to be maximized subject to precedence constraints...