Log in

Relevant bibliographies by topics / Dynamic programming. Data structures (Computer science) / Journal articles

To see the other types of publications on this topic, follow the link: Dynamic programming. Data structures (Computer science).

Journal articles on the topic 'Dynamic programming. Data structures (Computer science)'

Author: Grafiati

Published: 4 June 2021

Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Dynamic programming. Data structures (Computer science).'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

KELLY, PAUL H. J., and OLAV BECKMANN. "GENERATIVE AND ADAPTIVE METHODS IN PERFORMANCE PROGRAMMING." Parallel Processing Letters 15, no. 03 (2005): 239–55. http://dx.doi.org/10.1142/s0129626405002192.

Full text

Abstract:

Performance programming is characterized by the need to structure software components to exploit the context of use. Relevant context includes the target processor architecture, the available resources (number of processors, network capacity), prevailing resource contention, the values and shapes of input and intermediate data structures, the schedule and distribution of input data delivery, and the way the results are to be used. This paper concerns adapting to dynamic context: adaptive algorithms, malleable and migrating tasks, and application structures based on dynamic component compositio

APA, Harvard, Vancouver, ISO, and other styles

2

Ahn, Kook Jin, Graham Cormode, Sudipto Guha, Andrew McGregor, and Anthony Wirth. "Correlation Clustering in Data Streams." Algorithmica 83, no. 7 (2021): 1980–2017. http://dx.doi.org/10.1007/s00453-021-00816-9.

Full text

Abstract:

AbstractClustering is a fundamental tool for analyzing large data sets. A rich body of work has been devoted to designing data-stream algorithms for the relevant optimization problems such as k-center, k-median, and k-means. Such algorithms need to be both time and and space efficient. In this paper, we address the problem of correlation clustering in the dynamic data stream model. The stream consists of updates to the edge weights of a graph on n nodes and the goal is to find a node-partition such that the end-points of negative-weight edges are typically in different clusters whereas the end

APA, Harvard, Vancouver, ISO, and other styles

3

ALDINUCCI, MARCO. "${\mathsf{eskimo}}$: EXPERIMENTING WITH SKELETONS IN THE SHARED ADDRESS MODEL." Parallel Processing Letters 13, no. 03 (2003): 449–60. http://dx.doi.org/10.1142/s0129626403001410.

Full text

Abstract:

We discuss the lack of expressivity in some skeleton-based parallel programming frameworks. The problem is further exacerbated when approaching irregular problems and dealing with dynamic data structures. Shared memory programming has been argued to have substantial ease of programming advantages for this class of problems. We present the [Formula: see text] library which represents an attempt to merge the two programming models by introducing skeletons in a shared memory framework.

APA, Harvard, Vancouver, ISO, and other styles

4

MUKHOPADHYAY, RISHI, STEPHANIE IRAUSQUIN, CHRISTOPHER SCHMIDT, and HOMAYOUN VALAFAR. "DYNAFOLD: A DYNAMIC PROGRAMMING APPROACH TO PROTEIN BACKBONE STRUCTURE DETERMINATION FROM MINIMAL SETS OF RESIDUAL DIPOLAR COUPLINGS." Journal of Bioinformatics and Computational Biology 12, no. 01 (2014): 1450002. http://dx.doi.org/10.1142/s0219720014500024.

Full text

Abstract:

Residual Dipolar Couplings (RDCs) are a source of NMR data that can provide a powerful set of constraints on the orientation of inter-nuclear vectors, and are quickly becoming a larger part of the experimental toolset for molecular biologists. However, few reliable protocols exist for the determination of protein backbone structures from small sets of RDCs. DynaFold is a new dynamic programming algorithm designed specifically for this task, using minimal sets of RDCs collected in multiple alignment media. DynaFold was first tested utilizing synthetic data generated for the N – H , C α– H α, an

APA, Harvard, Vancouver, ISO, and other styles

5

BLIEM, BERNHARD, MICHAEL MORAK, and STEFAN WOLTRAN. "D-FLAT: Declarative problem solving using tree decompositions and answer-set programming." Theory and Practice of Logic Programming 12, no. 4-5 (2012): 445–64. http://dx.doi.org/10.1017/s1471068412000129.

Full text

Abstract:

AbstractIn this work, we propose Answer-Set Programming (ASP) as a tool for rapid prototyping of dynamic programming algorithms based on tree decompositions. In fact, many such algorithms have been designed, but only a few of them found their way into implementation. The main obstacle is the lack of easy-to-use systems which (i) take care of building a tree decomposition and (ii) provide an interface for declarative specifications of dynamic programming algorithms. In this paper, we present D-FLAT, a novel tool that relieves the user of having to handle all the technical details concerned with

APA, Harvard, Vancouver, ISO, and other styles

6

Merrell, David, and Anthony Gitter. "Inferring signaling pathways with probabilistic programming." Bioinformatics 36, Supplement_2 (2020): i822—i830. http://dx.doi.org/10.1093/bioinformatics/btaa861.

Full text

Abstract:

Abstract Motivation Cells regulate themselves via dizzyingly complex biochemical processes called signaling pathways. These are usually depicted as a network, where nodes represent proteins and edges indicate their influence on each other. In order to understand diseases and therapies at the cellular level, it is crucial to have an accurate understanding of the signaling pathways at work. Since signaling pathways can be modified by disease, the ability to infer signaling pathways from condition- or patient-specific data is highly valuable. A variety of techniques exist for inferring signaling

APA, Harvard, Vancouver, ISO, and other styles

7

Silapachote, Piyanuch, and Ananta Srisuphab. "Engineering Courses on Computational Thinking Through Solving Problems in Artificial Intelligence." International Journal of Engineering Pedagogy (iJEP) 7, no. 3 (2017): 34. http://dx.doi.org/10.3991/ijep.v7i3.6951.

Full text

Abstract:

Computational thinking sits at the core of every engineering and computing related discipline. It has increasingly emerged as its own subject in all levels of education. It is a powerful cornerstone for cognitive development, creative problem solving, algorithmic thinking and designs, and programming. How to effectively teach computational thinking skills poses real challenges and creates opportunities. Targeting entering computer science and engineering undergraduates, we resourcefully integrate elements from artificial intelligence (AI) into introductory computing courses. In addition to com

APA, Harvard, Vancouver, ISO, and other styles

8

POOLSAP, UNYANEE, YUKI KATO, KENGO SATO, and TATSUYA AKUTSU. "USING BINDING PROFILES TO PREDICT BINDING SITES OF TARGET RNAs." Journal of Bioinformatics and Computational Biology 09, no. 06 (2011): 697–713. http://dx.doi.org/10.1142/s0219720011005628.

Full text

Abstract:

Prediction of RNA–RNA interaction is a key to elucidating possible functions of small non-coding RNAs, and a number of computational methods have been proposed to analyze interacting RNA secondary structures. In this article, we focus on predicting binding sites of target RNAs that are expected to interact with regulatory antisense RNAs in a general form of interaction. For this purpose, we propose bistaRNA, a novel method for predicting multiple binding sites of target RNAs. bistaRNA employs binding profiles that represent scores for hybridized structures, leading to reducing the computationa

APA, Harvard, Vancouver, ISO, and other styles

9

Li, Jin, Chengzhen Xu, Lei Wang, et al. "PSRna: Prediction of small RNA secondary structures based on reverse complementary folding method." Journal of Bioinformatics and Computational Biology 14, no. 04 (2016): 1643001. http://dx.doi.org/10.1142/s0219720016430010.

Full text

Abstract:

Prediction of RNA secondary structures is an important problem in computational biology and bioinformatics, since RNA secondary structures are fundamental for functional analysis of RNA molecules. However, small RNA secondary structures are scarce and few algorithms have been specifically designed for predicting the secondary structures of small RNAs. Here we propose an algorithm named “PSRna” for predicting small-RNA secondary structures using reverse complementary folding and characteristic hairpin loops of small RNAs. Unlike traditional algorithms that usually generate multi-branch loops an

APA, Harvard, Vancouver, ISO, and other styles

10

WANG, SHENG, and WEI-MOU ZHENG. "CLePAPS: FAST PAIR ALIGNMENT OF PROTEIN STRUCTURES BASED ON CONFORMATIONAL LETTERS." Journal of Bioinformatics and Computational Biology 06, no. 02 (2008): 347–66. http://dx.doi.org/10.1142/s0219720008003461.

Full text

Abstract:

Fast, efficient, and reliable algorithms for pairwise alignment of protein structures are in ever-increasing demand for analyzing the rapidly growing data on protein structures. CLePAPS is a tool developed for this purpose. It distinguishes itself from other existing algorithms by the use of conformational letters, which are discretized states of 3D segmental structural states. A letter corresponds to a cluster of combinations of the three angles formed by Cα pseudobonds of four contiguous residues. A substitution matrix called CLESUM is available to measure the similarity between any two such

APA, Harvard, Vancouver, ISO, and other styles

11

Miyao, Yusuke, and Jun'ichi Tsujii. "Feature Forest Models for Probabilistic HPSG Parsing." Computational Linguistics 34, no. 1 (2008): 35–80. http://dx.doi.org/10.1162/coli.2008.34.1.35.

Full text

Abstract:

Probabilistic modeling of lexicalized grammars is difficult because these grammars exploit complicated data structures, such as typed feature structures. This prevents us from applying common methods of probabilistic modeling in which a complete structure is divided into sub-structures under the assumption of statistical independence among sub-structures. For example, part-of-speech tagging of a sentence is decomposed into tagging of each word, and CFG parsing is split into applications of CFG rules. These methods have relied on the structure of the target problem, namely lattices or trees, an

APA, Harvard, Vancouver, ISO, and other styles

12

SOLIMAN, MOSTAFA I., and STANISLAV G. SEDUKHIN. "PERFORMANCE EVALUATION OF BLAS ON THE TRIDENT PROCESSOR." Parallel Processing Letters 15, no. 04 (2005): 407–14. http://dx.doi.org/10.1142/s0129626405002325.

Full text

Abstract:

Different subtasks of an application usually have different computational, memory, and I/O requirements that result in different needs for computer capabilities. Thus, the more appropriate approach for both high performance and simple programming model is designing a processor having multi-level instruction set architecture (ISA). This leads to high performance and minimum executable code size. Since the fundamental data structures for a wide variety of existing applications are scalar, vector, and matrix, our research Trident processor has three-level ISA executed on zero-, one-, and two-dime

APA, Harvard, Vancouver, ISO, and other styles

13

Huang, Liang, He Zhang, Dezhong Deng, et al. "LinearFold: linear-time approximate RNA folding by 5'-to-3' dynamic programming and beam search." Bioinformatics 35, no. 14 (2019): i295—i304. http://dx.doi.org/10.1093/bioinformatics/btz375.

Full text

Abstract:

Abstract Motivation Predicting the secondary structure of an ribonucleic acid (RNA) sequence is useful in many applications. Existing algorithms [based on dynamic programming] suffer from a major limitation: their runtimes scale cubically with the RNA length, and this slowness limits their use in genome-wide applications. Results We present a novel alternative O(n3)-time dynamic programming algorithm for RNA folding that is amenable to heuristics that make it run in O(n) time and O(n) space, while producing a high-quality approximation to the optimal solution. Inspired by incremental parsing f

APA, Harvard, Vancouver, ISO, and other styles

14

HEUVELINE, VINCENT, and JONAS LATT. "THE OPENLB PROJECT: AN OPEN SOURCE AND OBJECT ORIENTED IMPLEMENTATION OF LATTICE BOLTZMANN METHODS." International Journal of Modern Physics C 18, no. 04 (2007): 627–34. http://dx.doi.org/10.1142/s0129183107010875.

Full text

Abstract:

The OpenLB project aims at setting up an open source implementation of lattice Boltzmann methods in an object oriented framework. The code, which is written in C ++, is intended to be used both by application programmers and by developers who may add their own particular dynamics. It supports advanced data structures that take into account complex geometries and parallel program executions. The programming concepts rely strongly on dynamic genericity through the use of object oriented interfaces as well as static genericity by means of templates. This design allows a straightforward and intuit

APA, Harvard, Vancouver, ISO, and other styles

15

Entzian, Gregor, Ivo L. Hofacker, Yann Ponty, Ronny Lorenz, and Andrea Tanzer. "RNAxplorer: harnessing the power of guiding potentials to sample RNA landscapes." Bioinformatics 37, no. 15 (2021): 2126–33. http://dx.doi.org/10.1093/bioinformatics/btab066.

Full text

Abstract:

Abstract Motivation Predicting the folding dynamics of RNAs is a computationally difficult problem, first and foremost due to the combinatorial explosion of alternative structures in the folding space. Abstractions are therefore needed to simplify downstream analyses, and thus make them computationally tractable. This can be achieved by various structure sampling algorithms. However, current sampling methods are still time consuming and frequently fail to represent key elements of the folding space. Method We introduce RNAxplorer, a novel adaptive sampling method to efficiently explore the str

APA, Harvard, Vancouver, ISO, and other styles

16

Shehab, Tariq, Reza Haghighat, Kiran K. Sajjan, and Vahid Balali. "Prioritization of K-12 School Maintenance Construction Projects Using Genetic Algorithm and Dynamic Programming Models." Journal of Information Technology in Construction 26 (March 23, 2021): 112–27. http://dx.doi.org/10.36680/j.itcon.2021.007.

Full text

Abstract:

High quality education standards and safe learning environments are the fundamental goals of most educational systems. One step towards achieving these goals is to keep existing school facilities in good working conditions through continues repair and maintenance programs. Due to limited resources, efficient use of allocated funds is necessary. This paper presents an optimization tool using Genetic Algorithm (GA) and Dynamic Programming (DP) that manages the expenses of K-12 school rehabilitation projects. These models help to find the optimum solutions among the given data through mutations a

APA, Harvard, Vancouver, ISO, and other styles

17

Glicksberg, Benjamin S., Boris Oskotsky, Phyllis M. Thangaraj, et al. "PatientExploreR: an extensible application for dynamic visualization of patient clinical history from electronic health records in the OMOP common data model." Bioinformatics 35, no. 21 (2019): 4515–18. http://dx.doi.org/10.1093/bioinformatics/btz409.

Full text

Abstract:

AbstractMotivationElectronic health records (EHRs) are quickly becoming omnipresent in healthcare, but interoperability issues and technical demands limit their use for biomedical and clinical research. Interactive and flexible software that interfaces directly with EHR data structured around a common data model (CDM) could accelerate more EHR-based research by making the data more accessible to researchers who lack computational expertise and/or domain knowledge.ResultsWe present PatientExploreR, an extensible application built on the R/Shiny framework that interfaces with a relational databa

APA, Harvard, Vancouver, ISO, and other styles

18

Chen, Chun-Chi, Hyundoo Jeong, Xiaoning Qian, and Byung-Jun Yoon. "TOPAS: network-based structural alignment of RNA sequences." Bioinformatics 35, no. 17 (2019): 2941–48. http://dx.doi.org/10.1093/bioinformatics/btz001.

Full text

Abstract:

Abstract Motivation For many RNA families, the secondary structure is known to be better conserved among the member RNAs compared to the primary sequence. For this reason, it is important to consider the underlying folding structures when aligning RNA sequences, especially for those with relatively low sequence identity. Given a set of RNAs with unknown structures, simultaneous RNA alignment and folding algorithms aim to accurately align the RNAs by jointly predicting their consensus secondary structure and the optimal sequence alignment. Despite the improved accuracy of the resulting alignmen

APA, Harvard, Vancouver, ISO, and other styles

19

Le, Phuoc Luong, Thien-My Dao, and Amin Chaabane. "BIM-based framework for temporary facility layout planning in construction site." Construction Innovation 19, no. 3 (2019): 424–64. http://dx.doi.org/10.1108/ci-06-2018-0052.

Full text

Abstract:

Purpose This paper aims to propose an innovative building information modelling (BIM)-based framework for multi-objective and dynamic temporary construction site layout design (SLD), which uses a hybrid approach of systematic layout planning (SLP) and mathematical modelling. Design/methodology/approach The hybrid approach, which follows a step-by-step process for site layout planning, is designed to facilitate both qualitative and quantitative data collection and processing. BIM platform is usedto facilitate the determination of the required quantitative data, while the qualitative data are ge

APA, Harvard, Vancouver, ISO, and other styles

20

Hains, Gaétan, Frédéric Loulergue, and John Mullins. "Concrete data structures and functional parallel programming." Theoretical Computer Science 258, no. 1-2 (2001): 233–67. http://dx.doi.org/10.1016/s0304-3975(00)00010-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Elmasry, Amr, Meng He, J. Ian Munro, and Patrick K. Nicholson. "Dynamic range majority data structures." Theoretical Computer Science 647 (September 2016): 59–73. http://dx.doi.org/10.1016/j.tcs.2016.07.039.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Leaver-Fay, Andrew, Yuanxin Liu, Jack Snoeyink, and Xueyi Wang. "Faster placement of hydrogens in protein structures by dynamic programming." ACM Journal of Experimental Algorithmics 12 (June 2008): 1–16. http://dx.doi.org/10.1145/1227161.1227167.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

J., Girish Raguvir, Manas Jyoti Kashyop, and N. S. Narayanaswamy. "Dynamic data structures for interval coloring." Theoretical Computer Science 838 (October 2020): 126–42. http://dx.doi.org/10.1016/j.tcs.2020.06.024.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Donner, Klaus. "Data structures and dynamic programming background for editing highly structured texts." Annals of Operations Research 16, no. 1 (1988): 267–80. http://dx.doi.org/10.1007/bf02283748.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Pucher, Krzysztof, and Dariusz Polok. "Analysis of Timings in Networks that Use TCP/IP or UDP/IP Protocols for Communication with Industrial Controllers in Mechatronic Systems." Solid State Phenomena 144 (September 2008): 94–99. http://dx.doi.org/10.4028/www.scientific.net/ssp.144.94.

Full text

Abstract:

In pace with the technical progress in controllability of mechatronic systems including machines and industrial equipment, the systems of industrial controllers (both PLC and microprocessor ones) more and more frequently use Ethernet-based networks for communication with supervising centres and surveillance systems. The Internet offers unsurpassed opportunities of remote programming as well as remote development, debugging and tuning the existing control software. Nowadays, supporting the remote tools and facilities is the essential requirement that is mandatory when decisions on purchase and

APA, Harvard, Vancouver, ISO, and other styles

26

Sakai, Hiroshi, Hiroaki Ishii, and Junzo Watada. "Special Issue on Forum for Interdisciplinary Mathematics 2013." Journal of Advanced Computational Intelligence and Intelligent Informatics 18, no. 6 (2014): 927–28. http://dx.doi.org/10.20965/jaciii.2014.p0927.

Full text

Abstract:

This special issue focuses on recent research in interdisciplinary mathematics and mathematical sciences. For the last four decades, the Forum for Interdisciplinary Mathematics (FIM), a society for researchers in mathematical sciences, has focused on mathematics, combinatorics, statistics, operations research, computer science, fuzzy sets, rough sets, bioinformatics, etc. The 22nd International Conference of FIM on Interdisciplinary Mathematics, Statistics and Computational Techniques (IMSCT 2013-FIM XXII) was held in Kitakyushu, Japan, on November 10-12, 2013. This conference was organized by

APA, Harvard, Vancouver, ISO, and other styles

27

HEDAR, ABDEL-RAHMAN, EMAD MABROUK, and MASAO FUKUSHIMA. "TABU PROGRAMMING: A NEW PROBLEM SOLVER THROUGH ADAPTIVE MEMORY PROGRAMMING OVER TREE DATA STRUCTURES." International Journal of Information Technology & Decision Making 10, no. 02 (2011): 373–406. http://dx.doi.org/10.1142/s0219622011004373.

Full text

Abstract:

Since the first appearance of the Genetic Programming (GP) algorithm, extensive theoretical and application studies on it have been conducted. Nowadays, the GP algorithm is considered one of the most important tools in Artificial Intelligence (AI). Nevertheless, several questions have been raised about the complexity of the GP algorithm and the disruption effect of the crossover and mutation operators. In this paper, the Tabu Programming (TP) algorithm is proposed to employ the search strategy of the classical Tabu Search algorithm with the tree data structure. Moreover, the TP algorithm explo

APA, Harvard, Vancouver, ISO, and other styles

28

Hendren, Laurie J., and Guang R. Gao. "Designing programming languages for the analyzability of pointer data structures." Computer Languages 19, no. 2 (1993): 119–34. http://dx.doi.org/10.1016/0096-0551(93)90006-m.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Jianhong, Wang. "Dynamic Programming in Data Driven Model Predictive Control?" WSEAS TRANSACTIONS ON SYSTEMS 20 (July 21, 2021): 170–77. http://dx.doi.org/10.37394/23202.2021.20.19.

Full text

Abstract:

In this short note, one data driven model predictive control is studied to design the optimal control sequence. The idea of data driven means the actual output value in cost function for model predictive control is identi_ed through input-output observed data in case of unknown but bounded noise and martingale di_erence sequence. After substituting the identi_ed actual output in cost function, the total cost function in model predictive control is reformulated as the other standard form, so that dynamic programming can be applied directly. As dynamic programming is only used in optimization th

APA, Harvard, Vancouver, ISO, and other styles

30

Gagie, Travis, Meng He, and Gonzalo Navarro. "Compressed Dynamic Range Majority and Minority Data Structures." Algorithmica 82, no. 7 (2020): 2063–86. http://dx.doi.org/10.1007/s00453-020-00687-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Henzinger, Monika R. "Improved Data Structures for Fully Dynamic Biconnectivity." SIAM Journal on Computing 29, no. 6 (2000): 1761–815. http://dx.doi.org/10.1137/s0097539794263907.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Kenyon-Mathieu, Claire M., and Jeffrey Scott Vitter. "The Maximum Size of Dynamic Data Structures." SIAM Journal on Computing 20, no. 5 (1991): 807–23. http://dx.doi.org/10.1137/0220050.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Smid, Michiel H. M., Mark H. Overmars, Leen Torenvliet, and Peter van Emde Boas. "Maintaining multiple representations of dynamic data structures." Information and Computation 83, no. 2 (1989): 206–33. http://dx.doi.org/10.1016/0890-5401(89)90058-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Seco, João, Ricardo Silva, and Margarida Piriquito. "Component J: A component-based programming language with dynamic reconfiguration." Computer Science and Information Systems 5, no. 2 (2008): 63–86. http://dx.doi.org/10.2298/csis0802063s.

Full text

Abstract:

This paper describes an evolution of the ComponentJ programming language, a component-based Java-like programming language where composition is the chosen structuring mechanism. ComponentJ constructs allow for the high-level specification of component structures, which are the basis for the definition of compound objects. In this paper we present a new language design for ComponentJ which is more flexible and also allows the dynamic reconfiguration of objects. The manipulation of components and composition operations at the programming language level allows for the compile time verification, b

APA, Harvard, Vancouver, ISO, and other styles

35

Moor, Oege De. "Categories, relations and dynamic programming." Mathematical Structures in Computer Science 4, no. 1 (1994): 33–69. http://dx.doi.org/10.1017/s0960129500000360.

Full text

Abstract:

Dynamic programming is a strategy for solving optimisation problems. In this paper, we show how many problems that may be solved by dynamic programming are instances of the same abstract specification. This specification is phrased using the calculus of relations offered by topos theory. The main theorem underlying dynamic programming can then be proved by straightforward equational reasoning.The generic specification of dynamic programming makes use of higher-order operators on relations, akin to the fold operators found in functional programming languages. In the present context, a data type

APA, Harvard, Vancouver, ISO, and other styles

36

RAUBER, THOMAS, and GUDULA RÜNGER. "A DATA RE-DISTRIBUTION LIBRARY FOR MULTI-PROCESSOR TASK PROGRAMMING." International Journal of Foundations of Computer Science 17, no. 02 (2006): 251–70. http://dx.doi.org/10.1142/s0129054106003814.

Full text

Abstract:

Multiprocessor task (M-task) programming is a suitable parallel programming model for coding application problems with an inherent modular structure. An M-task can be executed on a group of processors of arbitrary size, concurrently to other M-tasks of the same application program. The data of a multiprocessor task program usually include composed data structures, like vectors or arrays. For distributed memory machines or cluster platforms, those composed data structures are distributed within one or more processor groups. Thus, a concise parallel programming model for M-tasks requires a stand

APA, Harvard, Vancouver, ISO, and other styles

37

Zhang, Nan, Benjamin D. Leibowicz, and Grani A. Hanasusanto. "Optimal Residential Battery Storage Operations Using Robust Data-Driven Dynamic Programming." IEEE Transactions on Smart Grid 11, no. 2 (2020): 1771–80. http://dx.doi.org/10.1109/tsg.2019.2942932.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

LAUER, TOBIAS, THOMAS OTTMANN, and AMITAVA DATTA. "UPDATE-EFFICIENT DATA STRUCTURES FOR DYNAMIC IP ROUTER TABLES." International Journal of Foundations of Computer Science 18, no. 01 (2007): 139–61. http://dx.doi.org/10.1142/s0129054107004607.

Full text

Abstract:

We show that two data structures, min-augmented range tree and priority search pennant, efficiently support all the required operations for updatable IP router tables and argue that both structures are better suited for the one-dimensional dynamic IP lookup problem than the priority search tree (PST) used in a previous solution. It is possible to maintain both structures in time O(1) after a rotation, while PST with n elements may require Ω( log n) steps for a single rotation. Therefore, the proposed structures can be balanced using a larger class of rebalancing schemes compared to PST. Both s

APA, Harvard, Vancouver, ISO, and other styles

39

LAUER, TOBIAS, THOMAS OTTMANN, and AMITAVA DATTA. "UPDATE-EFFICIENT DATA STRUCTURES FOR DYNAMIC IP ROUTER TABLES." International Journal of Foundations of Computer Science 18, no. 02 (2007): 295–317. http://dx.doi.org/10.1142/s0129054107004693.

Full text

Abstract:

We show that two data structures, min-augmented range tree and priority search pennant, efficiently support all the required operations for updatable IP router tables and argue that both structures are better suited for the one-dimensional dynamic IP lookup problem than the priority search tree (PST) used in a previous solution. It is possible to maintain both structures in time O(1) after a rotation, while PST with n elements may require Ω( log n) steps for a single rotation. Therefore, the proposed structures can be balanced using a larger class of rebalancing schemes compared to PST. Both s

APA, Harvard, Vancouver, ISO, and other styles

40

Ben-Amram and Galil. "Lower Bounds for Dynamic Data Structures on Algebraic RAMs." Algorithmica 32, no. 3 (2002): 364–95. http://dx.doi.org/10.1007/s00453-001-0079-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Elhenawy, Mohammed, Hao Chen, and Hesham A. Rakha. "Dynamic travel time prediction using data clustering and genetic programming." Transportation Research Part C: Emerging Technologies 42 (May 2014): 82–98. http://dx.doi.org/10.1016/j.trc.2014.02.016.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Li, Guoqiang, Daniel Görges, and Chaoxu Mu. "Integrated adaptive dynamic programming for data-driven optimal controller design." Neurocomputing 403 (August 2020): 143–52. http://dx.doi.org/10.1016/j.neucom.2020.04.095.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

GAVA, FRÉDÉRIC. "A MODULAR IMPLEMENTATION OF DATA STRUCTURES IN BULK-SYNCHRONOUS PARALLEL ML." Parallel Processing Letters 18, no. 01 (2008): 39–53. http://dx.doi.org/10.1142/s0129626408003211.

Full text

Abstract:

A functional data-parallel language called BSML has been designed for programming Bulk-Synchronous Parallel algorithms. Many sequential algorithms do not have parallel counterparts and many non-computer science researchers do not want to deal with parallel programming. In sequential programming environments, common data structures are often provided through reusable libraries to simplify the development of applications. A parallel representation of such data structures is thus a solution for writing parallel programs without suffering from disadvantages of all the features of a parallel langua

APA, Harvard, Vancouver, ISO, and other styles

44

Tang, Wentao, and Prodromos Daoutidis. "Distributed adaptive dynamic programming for data-driven optimal control." Systems & Control Letters 120 (October 2018): 36–43. http://dx.doi.org/10.1016/j.sysconle.2018.08.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Guessarian, Irène. "Some Fixpoint Techniques in Algebraic Structures and Applications to Computer Science." Fundamenta Informaticae 10, no. 4 (1987): 387–413. http://dx.doi.org/10.3233/fi-1987-10405.

Full text

Abstract:

This paper recalls some fixpoint theorems in ordered algebraic structures and surveys some ways in which these theorems are applied in computer science. We describe via examples three main types of applications: in semantics and proof theory, in logic programming and in deductive data bases.

APA, Harvard, Vancouver, ISO, and other styles

46

Golin, Mordecai, Rajeev Raman, Christian Schwarz, and Michiel Smid. "Randomized Data Structures for the Dynamic Closest-Pair Problem." SIAM Journal on Computing 27, no. 4 (1998): 1036–72. http://dx.doi.org/10.1137/s0097539794277718.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Zhao, Hui, Meikang Qiu, Min Chen, and Keke Gai. "Cost-aware optimal data allocations for multiple dimensional heterogeneous memories using dynamic programming in big data." Journal of Computational Science 26 (May 2018): 402–8. http://dx.doi.org/10.1016/j.jocs.2016.06.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Zhang, Wei, Tingjun Hou, Xuebin Qiao, and Xiaojie Xu. "Some Basic Data Structures and Algorithms for Chemical Generic Programming." Journal of Chemical Information and Computer Sciences 44, no. 5 (2004): 1571–75. http://dx.doi.org/10.1021/ci049938s.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Xie, Junjie, Lijun Lyu, Yuhui Deng, and Laurence T. Yang. "Improving Routing Performance via Dynamic Programming in Large-Scale Data Centers." IEEE Internet of Things Journal 2, no. 4 (2015): 321–28. http://dx.doi.org/10.1109/jiot.2014.2386326.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Bishop, J. "Introduction to Pascal and Structured Design; Pascal plus Data Structures, Algorithms and Advanced Programming." Computer Journal 35, no. 3 (1992): 255. http://dx.doi.org/10.1093/comjnl/35.3.255.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!