Manish H, Ranga Vemuri · 2013
A fast and efficient algorithm for finding empty area is necessary for online placement, task relocation and defragmentation on a partially reconfigurable FPGA. We present an algorithm that finds empty area as a list of overlapping maximal rectangles. Using an innovative representation of the FPGA, we are able to predict possible locations of the maximal empty rectangles. Worst-case time complexity of our algorithm is O(xy) where x is the number of columns, y is the number of rows and x.y is the total number of cells on the FPGA. Experiments show that, in practice, our algorithm needs to scan less than 15 % of the FPGA cells to make a list of all maximal empty rectangles. Categories and Subject Descriptors
Cited by 0
Alexander Apke, Vera Weil, Jens Dörpinghaus et al. · Studies in big data · 2022
Cited by 0
2008
Many embedded systems are designed to take timely reactions to the occurrences of interested scenarios. Sometimes transient overloads might be experienced due to hardware malfunctions or workload bursts. Thus a mechanism to focus system attention on urgent events could be a key to provide reasonably stable service. In this paper, we propose a new approach for workload scaling in uniprocessor real-time embedded systems. A deterministic algorithm is adopted to selectively fed hardware events into a system, and an event-driven task model is introduced to formulate complex precedence constraints among tasks. Such a new approach removes the need for the adjustments of task periods and task phasing, which is crucial for many time-driven systems. The proposed approach was implemented in a realtime surveillance system, for which good accuracy and responsiveness were obtained under stressing workloads.
Cited by 0
Dakun Liu (17134594), Wei Zhou (24328), Linzhen Zhou (19812738) et al. · Figshare · 2024
<div><p>This study aims to improve the helicopter electric power inspection process by using the feature embedding convolution (FEC) model to solve the problems of small scope and poor real-time inspection. First, simulation experiments and model analysis determine the keyframe and flight trajectory. Second, an improved FEC model is proposed, extracting features from aerial images in large ranges in real time and accurately identifying and classifying electric power inspection targets. In the simulation experiment, the accuracy of the model in electric power circuit and equipment detection is improved by 30% compared with the traditional algorithm, and the inspection range is expanded by 26%. In addition, this study further optimizes the model with reinforcement learning technology, conducts a comparative analysis of different flight environments and facilities, and reveals the diversity and complexity of inspection objectives. The performance of the optimized model in fault detection is increased by more than 36%. In conclusion, the proposed model improves the accuracy and scope of inspection, provides a more scientific strategy for electric power inspection, and ensures inspection efficiency.</p></div>
Cited by 0Open access
Apke, Alexander, Weil, Vera, Dörpinghaus, Jens et al. · DZNE Pub · 2022
Cited by 0
Veli Mäkinen, Djamal Belazzougui, Fabio Cunial et al. · Cambridge University Press eBooks · 2023
This chapter gives an introduction to complexity analysis, data representations, and reductions. In addition, the Knuth–Morris–Pratt algorithm is covered to give some taste of dynamic programming – a technique introduced in Chapters 4 and 6 and used extensively thereafter.
Cited by 1
Jon Kleinberg, Éva Tardos · 2005
Algorithm Design introduces algorithms by looking at the real-world problems that motivate them. The book teaches students a range of design and analysis techniques for problems that arise in computing applications. The text encourages an understanding of the algorithm design process and an appreciation of the role of algorithms in the broader field of computer science.
Cited by 1,027
Kleinberg, Jon 1971-, Tardos, Éva 1957- · 2006
Cited by 0
Fuqiang Qian, Haitong Tian, Evangeline Young · 2013
Link based non-tree clock network is an effective and economic way to reduce clock skew caused by variations. However, it is still an open topic where links should be inserted in order to achieve largest skew reduction with smaller extra resources. We propose a new method using linear program to solve this problem in this paper. In our approach, clock skew in a non-tree clock network is computed using the delay model in [13] and the information is used to select the node pairs for link insertion. Tradeoff between crosslink length and skew reduction effect is explored. Based on the analysis, we propose a new algorithm to insert crosslinks into a clock network. We compare our work with the method in [1] and a recent work [4] which inserts links between internal nodes of a tree. Experiments show that our method can reduce skew under variations effectively.
Cited by 0
Deepak Ajwani, Itay Malinger, Ulrich Meyer et al. · 2013
Cited by 0
Kleinberg, Jon, Tardos, Éva 1957- · 2006
Cited by 0
Kleinberg, Jon, Tardos, Eva · CERN Document Server (European Organization for Nuclear Research) · 2006
Algorithm Design introduces algorithms by looking at the real-world problems that motivate them. The book teaches students a range of design and analysis techniques for problems that arise in computing applications. The text encourages an understanding of the algorithm design process and an appreciation of the role of algorithms in the broader field of computer science.
Cited by 0
Giorgio Ausiello · Lecture notes in computer science · 2000
Cited by 0Open access
Ping Jiang (243020), Ryosuke Chiba (3131130), Kaoru Takakusaki (3131127) et al. · Figshare · 2016
<p>The red and blue areas indicate the <b><i>u</i></b><sub><i>ff</i></sub> calculation algorithm and the PD gain optimization algorithm, respectively.</p>
Cited by 0Open access
N. Uday Bhaskar · Zenodo (CERN European Organization for Nuclear Research) · 2026
Cited by 0Open access
Jeff Andrews, Frances E. Likis · Journal of Lower Genital Tract Disease · 2015
An annotated algorithm may be used by authors, readers, and reviewers to consistently determine the design of clinical research studies.
Cited by 15
Antti Laaksonen · Undergraduate topics in computer science · 2020
Cited by 0
Bush Jones · ACM SIGCSE Bulletin · 1979
article Free Access Share on Teaching algorithm design Author: Bush Jones Louisiana State University, Baton Rouge, LA Louisiana State University, Baton Rouge, LAView Profile Authors Info & Claims ACM SIGCSE BulletinVolume 11Issue 4December 1979pp 27–30https://doi.org/10.1145/988938.988943Published:01 December 1979Publication History 1citation105DownloadsMetricsTotal Citations1Total Downloads105Last 12 Months9Last 6 weeks3 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Cited by 1Open access
Pietro Michiardi · 2013
Developing algorithms involve: ◮ Preparing the input data ◮ Implement the mapper and the reducer ◮ Optionally, design the combiner and the partitioner How to recast existing algorithms in MapReduce? ◮ It is not always obvious how to express algorithms ◮ Data structures play an important role ◮ Optimization is hard → The designer needs to “bend ” the framework Learn by examples ◮ “Design patterns” ◮ Synchronization is perhaps the most tricky aspect
Cited by 0
Tim Crawford, Costas S. Iliopoulos · 2008
Cited by 0