Filters








15,471 Hits in 5.5 sec

An Optimal Incremental Algorithm for Minimizing Lateness with Rejection [chapter]

Samir Khuller, Julián Mestre
Lecture Notes in Computer Science  
This allows for an incremental solution in which we can keep incrementally rejecting jobs if we need a solution with lower maximum lateness value.  ...  this permutation, we derive an optimal solution for the problem in which we are allowed to reject k jobs.  ...  Acknowledgements: We would like to thank the anonymous referees for helpful suggestions.  ... 
doi:10.1007/978-3-540-87744-8_50 fatcat:mhgidxphwbaibdd4mym4klainq

The Power of Amortized Recourse for Online Graph Problems [article]

Hsiang-Hsuan Liu, Jonathan Toole-Charignon
2022 arXiv   pre-print
For Independent Set, we refine the analysis of our general algorithm and show that t-competitiveness can be achieved with t/t-1 amortized recourse.  ...  We further show that the general algorithm can be improved for three classical graph problems by carefully choosing the referenced algorithm and tuning its detailed behavior.  ...  For example, the Ramsey algorithm in [8] is an incremental algorithm.  ... 
arXiv:2206.01077v2 fatcat:s4nrq4kvljhthjl5dmxvckfjim

Order acceptance and scheduling: A taxonomy and review

Susan A. Slotnick
2011 European Journal of Operational Research  
Sengupta (2003) presents a pseudo-polynomial algorithm, an FPTAS, and an E-optimization approximation for the single-machine case with the objective of minimizing rejection penalties and maximum lateness  ...  Cheng and Sun (2009) de velop optimal DP algorithms and FPTASs, with polynomial-time algorithms for the problem with deteriorating processing times, focusing on three single-machine objectives: minimizing  ... 
doi:10.1016/j.ejor.2010.09.042 fatcat:6xttqh2c4fhqjboou2tgffuary

Modeling and solution methods for hybrid flow shop scheduling problem with job rejection

Mohamadreza Dabiri, Mehdi Yazdani, Bahman Naderi, Hassan Haleh
2021 Operational Research  
Also, this paper exhibits two innovative heuristic algorithms, which are presented to discover fast solutions for the problem along with five meta-heuristics are adapted to solve large-sized problems in  ...  This paper addresses the hybrid flow shop scheduling problem by considering job rejection to minimize the sum of the total tardiness cost of the scheduled jobs and total cost of the rejected jobs as a  ...  lateness Maximum tardiness Makespan - Dynamic programming PTAS Khuller and Mestre (2008) Single machine Maximum lateness Maximum tardiness - ε-approximate Optimal incremental algorithm  ... 
doi:10.1007/s12351-021-00629-2 fatcat:33sxe5n7znhtxls3fnttt7dg5a

Limitations of Incremental Dynamic Programming

Stasys Jukna
2013 Algorithmica  
We show that any incremental algorithm for this problem must produce about nK subproblems, and that about nK log K wires (relations between subproblems) are necessary.  ...  The classical dynamic programming algorithm for the Knapsack problem is incremental, produces nK subproblems and nK 2 relations (wires) between the subproblems, where n is the number of items, and K is  ...  My thanks to anonymous referees for stimulating comments; I am especially obligated to one of them for suggesting to use even-odd pairs in the proof of Theorem 5.  ... 
doi:10.1007/s00453-013-9747-6 fatcat:wfkdrnhdffadnjmntzfomfy2zy

Relaxing the Irrevocability Requirement for Online Graph Algorithms [chapter]

Joan Boyar, Lene M. Favrholdt, Michal Kotrbčík, Kim S. Larsen
2017 Lecture Notes in Computer Science  
Similarly, we also consider a Late Reject model, where an accepted request can later be rejected, but any rejection is irrevocable (this is sometimes called preemption).  ...  Motivated by practical examples where, for example, there is a cost associated with building a facility and no extra cost associated with doing it later, we consider the Late Accept model, where a request  ...  We first show that Algorithm 2 is a Late Accept/Reject algorithm, i.e., no edge which is late-rejected is later late-accepted. Suppose an edge e = uv is late-rejected in some step i.  ... 
doi:10.1007/978-3-319-62127-2_19 fatcat:gpsie4bfqndixfuvncbtgfmvfm

Relaxing the Irrevocability Requirement for Online Graph Algorithms [article]

Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Michal Kotrbčík
2017 arXiv   pre-print
Similarly, we also consider a Late Reject model, where an accepted request can later be rejected, but any rejection is irrevocable (this is sometimes called preemption).  ...  Motivated by practical examples where, for example, there is a cost associated with building a facility and no extra cost associated with doing it later, we consider the Late Accept model, where a request  ...  We first show that Algorithm 2 is a Late Accept/Reject algorithm, i.e., no edge which is late-rejected is later late-accepted. Suppose an edge e = uv is late-rejected in some step i.  ... 
arXiv:1704.08835v1 fatcat:35isbiy5nra3tdje6oskej4tha

Incremental and Parallel Machine Learning Algorithms With Automated Learning Rate Adjustments

Kazuhiro Hishinuma, Hideaki Iiduka
2019 Frontiers in Robotics and AI  
This implies that the two algorithms are generalizations of the existing incremental and parallel subgradient algorithms for solving constrained nonsmooth convex optimization problems.  ...  The existing machine learning algorithms for minimizing the convex function over a closed convex set suffer from slow convergence because their learning rates must be determined before running them.  ...  We are sincerely grateful to the Topic Editor Guido Bologna and the two reviewers for helping us improve the original manuscript.  ... 
doi:10.3389/frobt.2019.00077 pmid:33501092 pmcid:PMC7805887 fatcat:ailov3drszbu5ke7qk7eku77aa

Page 7209 of Mathematical Reviews Vol. , Issue 2003i [page]

2003 Mathematical Reviews  
Finally, we give an optimal polynomial algorithm for the makespan problem with two distinct processing rates.  ...  Summary: “This paper presents a branch and bound algorithm for the single machine scheduling problem 1\r;| > U; where the objective function is to minimize the number of late jobs.  ... 

Incremental Lagrangian Relaxation Based Discrete Gate Sizing and Threshold Voltage Assignment

Dimitrios Mangiras, Giorgos Dimitrakopoulos
2021 Technologies  
To this end, we transform a powerful Lagrangian-relaxation-based optimizer, used for global timing optimization early in the design flow, into a practical incremental timing optimizer that corrects small  ...  timing violations with fast runtime and without increasing the area/power of the design.  ...  Algorithm 1: Find best size for gate g.  ... 
doi:10.3390/technologies9040092 fatcat:g2gcqhm5wbgmbct2zjipbrecnm

The Extreme Value Machine

Ethan M. Rudd, Lalit P. Jain, Walter J. Scheirer, Terrance E. Boult
2018 IEEE Transactions on Pattern Analysis and Machine Intelligence  
With this ability, new class labels could be assigned to these inputs by a human operator, allowing them to be incorporated into the recognition function --- ideally under an efficient incremental update  ...  While good algorithms that assume inputs from a fixed set of classes exist, e.g., artificial neural networks and kernel machines, it is not immediately obvious how to extend them to perform incremental  ...  For consistency with [5] , we selected an NNO rejection threshold via 3-fold cross-class validation on the training set.  ... 
doi:10.1109/tpami.2017.2707495 pmid:28541894 fatcat:bm3fnvizyzeszeyrhdaxor3xty

Grouping text lines in freeform handwritten notes

M. Ye, H. Sutanto, S. Raghupathy, C. Li, M. Shilman
2005 Eighth International Conference on Document Analysis and Recognition (ICDAR'05)  
This paper presents an optimization method for text line grouping.  ...  A dynamic programming algorithm provides an initial segmentation of the time-ordered stroke sequence.  ...  The algorithm also provides a natural solution to incremental parsing, an important requirement for realtime ink analysis.  ... 
doi:10.1109/icdar.2005.121 dblp:conf/icdar/YeSRLS05 fatcat:ytaothoxfbd4tdsfgo27i6zlfu

Defining the optimal systolic phase targets using absolute delay time for reconstructions in dual-source coronary CT angiography

Csilla Celeng, Harshna Vadvala, Stefan Puchner, Amit Pursnani, Umesh Sharma, Attila Kovacs, Pâl Maurovich-Horvat, Udo Hoffmann, Brian Ghoshhajra
2015 The International Journal of Cardiovascular Imaging  
To define the optimal systolic phase for dual-source computed tomography angiography using an absolute reconstruction delay time after the R-R interval based on the coronary artery motion, we analyzed  ...  No differences were found in the minimal coronary artery velocities between the three HR groups, with the exception of the AM1 branch (p = 0.00495) between <65 and >80 bpm (p = 0.03), and at HRs of 65-  ...  Prospectively ECG-triggered axial-sequential acquisition (Sequential Scanning; Siemens) with an advanced arrhythmia rejection algorithm mode (Adaptive Cardio Sequence, "Adaptive Cardio Sequential Flex  ... 
doi:10.1007/s10554-015-0755-2 pmid:26335369 pmcid:PMC5943709 fatcat:dg5isnxxlbcullg34ky6ba4amu

Custom Instruction Generation Using Temporal Partitioning Techniques for a Reconfigurable Functional Unit [chapter]

Farhad Mehdipour, Hamid Noori, Morteza Saheb Zamani, Kazuaki Murakami, Koji Inoue, Mehdi Sedighi
2006 Lecture Notes in Computer Science  
Extracting appropriate custom instructions is an important phase for implementing an application on an extensible processor with a reconfigurable functional unit (RFU).  ...  In this framework, two mapping aware temporal partitioning algorithms are used to generate CIs. Temporal partitioning iterates and modifies partitions incrementally to generate CIs.  ...  Acknowledgement The authors would like to thank System LSI Laboratory of Kyushu University for providing the necessary facilities and equipments.  ... 
doi:10.1007/11802167_73 fatcat:e3hagquymvgxtffqhptqpe2bai

Online Maximum Matching with Recourse [article]

Spyros Angelopoulos, Christoph Dürr, Shendan Jin
2018 arXiv   pre-print
An online algorithm for this problem has to maintain a valid matching while edges of the underlying graph are presented one after the other.  ...  Moreover, we present and analyze an improvement of the greedy algorithm which we call L-Greedy, and we show that for small values of k it outperforms the algorithm of [AMP13].  ...  [3] refer to this model for k = 1 as the late accept model, and for k = 2 as the late accept/reject model.  ... 
arXiv:1801.03462v2 fatcat:gcusw6uujzaftfpwisiog5ae4q
« Previous Showing results 1 — 15 out of 15,471 results