119,074 Hits in 8.3 sec

Bounded Incremental Real-Time Dynamic Programming

Changjie Fan, Xiaoping Chen
2007 2007 Frontiers in the Convergence of Bioscience and Information Technologies  
We present a Bounded Incremental Real-Time Dynamic Programming algorithm (BIRTDP).  ...  A real-time multi-step planning problem is characterized by alternating decision-making and execution processes, whole online decision-making time divided in slices between each execution, and the pressing  ...  Bounded Incremental RTDP Branch-Selection Strategy In the process of a real-time dynamic programming using both upper and lower bounds, criterion (I) indicates the uncertainty V of the initial state  ... 
doi:10.1109/fbit.2007.14 dblp:conf/fbit/FanC07 fatcat:5okhrvtu6rbzvc4r3iouvupzai

Exact and Stable Recovery of Sequences of Signals with Sparse Increments via Differential _1-Minimization

Demba E. Ba, Behtash Babadi, Patrick L. Purdon, Emery N. Brown
2012 Neural Information Processing Systems  
In the presence of bounded noise, we propose a quadratically-constrained convex program for recovery and derive bounds on the reconstruction error of the sequence.  ...  We supplement our theoretical analysis with simulations and an application to real video data.  ...  Finally, we derive error bounds for program (P2) in the context of recovery of sequences of vectors with sparse increments in the presence of noise.  ... 
dblp:conf/nips/BaBPB12 fatcat:zemdy7zqavfd7pdnoikr3oduxy

Refinement Types for Incremental Computational Complexity [chapter]

Ezgi Çiçek, Deepak Garg, Umut Acar
2015 Lecture Notes in Computer Science  
With recent advances, programs can be compiled to efficiently respond to incremental input changes.  ...  Motivated by this gap, we present CostIt, a higher-order functional language with a lightweight refinement type system for proving asymptotic bounds on incremental computation time.  ...  However, in all prior work on incremental computation, the programmer must reason about the time complexity of incremental execution, which we call dynamic stability, by direct analysis of the cost semantics  ... 
doi:10.1007/978-3-662-46669-8_17 fatcat:2xeokb7bkrfhliawljusgw6pwy

Incremental Techniques for Large-Scale Dynamic Query Processing

Iman Elghandour, Ahmet Kara, Dan Olteanu, Stijn Vansummeren
2018 Proceedings of the 27th ACM International Conference on Information and Knowledge Management - CIKM '18  
Many applications from various disciplines are now required to analyze fast evolving big data in real time. Various approaches for incremental processing of queries have been proposed over the years.  ...  CCS CONCEPTS • Theory of computation → Lower bounds and information complexity; Database query processing and optimization (theory); Distributed computing models;  ...  Here, dynamic processing refers to updating the query result, preferably in real-time, when the underlying data is updated.  ... 
doi:10.1145/3269206.3274271 dblp:conf/cikm/Elghandour0OV18 fatcat:rwdtjicsibghzgvdajh5puobjm

An On-Line Time Warping Algorithm for Tracking Musical Performances

Simon Dixon
2005 International Joint Conference on Artificial Intelligence  
We present a novel online time warping algorithm which has linear time and space costs, and performs incremental alignment of two series as one is received in real time.  ...  Dynamic time warping is not suitable for on-line applications because it requires complete knowledge of both series before the alignment of the first elements can be computed.  ...  On-Line Time Warping Although efficiency and real-time concerns of dynamic time warping (DTW) have been addressed in the literature, we do not know of any work in which the real-time constraint involves  ... 
dblp:conf/ijcai/Dixon05 fatcat:6lrtsw2bcfellfhg5zgmbqt4nu

Page 16 of Hewlett-Packard Journal Vol. 35, Issue 3 [page]

1984 Hewlett-Packard Journal  
and REPEAT loops, and CASE. = A REDIM statement that can dynamically change array bounds. = Dynamic variable allocation/deallocation via the ALLO- CATE and DEALLOCATE statements.  ...  The icode con- texts also contain the incrementally compiled object code produced by the run-time compiler as the program runs. Intermediate Code Contexts.  ... 

Using global data flow analysis on bytecode to aid worst case execution time analysis for real-time Java programs

James J. Hunt, Isabel Tonin, Fridtjof B. Siebert
2008 Proceedings of the 6th international workshop on Java technologies for real-time and embedded systems - JTRES '08  
Though realtime Java offers significant advantages over other programming languages for safe programming, the analysis of worst case execution of realtime Java programs is considerably more difficult.  ...  necessary to determine the worst case execution time analysis of realtime Java programms.  ...  Java technology along with the Real-Time Specification for Java (RTSJ) offers significant advantages for programming complex systems at the cost of adding features that complicate timing analysis.  ... 
doi:10.1145/1434790.1434806 dblp:conf/jtres/HuntTS08 fatcat:qvexctcr2fg4rdpafdqpqyd7he

Concurrency and Scalability versus Fragmentation and Compaction with Compact-fit [article]

Silviu S. Craciunas, Christoph M. Kirsch, Hannes Payer, Harald Röck, Ana Sokolova
2014 arXiv   pre-print
We study, formally and experimentally, the trade-off in temporal and spatial overhead when managing contiguous blocks of memory using the explicit, dynamic and real-time heap management system Compact-fit  ...  The key property of CF is that temporal and spatial overhead can be bounded, related, and predicted in constant time through the notion of partial and incremental compaction.  ...  The key to enabling dynamic heap management in real-time and embedded applications is to make it incremental and to bound memory fragmentation.  ... 
arXiv:1404.1830v1 fatcat:4y4rx27qcnbubnl4uplhg55swq

Incremental Techniques for Large-Scale Dynamic Query Processing [article]

Iman Elghandour and Ahmet Kara and Dan Olteanu and Stijn Vansummeren
2019 arXiv   pre-print
Many applications from various disciplines are now required to analyze fast evolving big data in real time. Various approaches for incremental processing of queries have been proposed over the years.  ...  In this tutorial, we briefly discuss legacy approaches for incremental query processing, and then give an overview of the new challenges introduced due to processing big data streams.  ...  Here, dynamic processing refers to updating the query result, preferably in real-time, when the underlying data is updated.  ... 
arXiv:1902.00585v1 fatcat:4dtwnxhiqjfqdbb63tartjo4fq

An approach to reducing the high-speed memory requirement of dynamic programming

Robert E Larson
1965 Journal of Mathematical Analysis and Applications  
Real-Time Control of Supersonic Air Transports A method has been developed [4,5] f or using the same basic program for real-time control of these aircraft.  ...  The name "statement increment dynamic programming" is derived from the fact that control is applied until one of the states changes by one increment.  ... 
doi:10.1016/0022-247x(65)90102-2 fatcat:olzwpakn4nenrebqdj4n3mwcnq

Worst-Case Execution Time Analysis For Digital Signal Processors

Niklas Holsti, Thomas Lcingbacka, Sami Saarinen
2000 Zenodo  
We are working to make BOUND-T into a commercial product. This includes ports to other target processors and host platforms.  ...  Currently we are in the stage of starting a market analysis, to look for -among other things -suitable target processors for which to port BOUND-T.  ...  INTRODUCTION Space Systems Finland (SSF) is developing a software tool called BOUND-T for estimating worst-case execution times (WCET) for real-time, embedded programs.  ... 
doi:10.5281/zenodo.37579 fatcat:e5a7sbzq7raxbmz2s7ddqcrnve

Incremental symbolic execution for automated test suite maintenance

Sarmad Makhdoom, Muhammad Adeel Khan, Junaid Haroon Siddiqui
2014 Proceedings of the 29th ACM/IEEE international conference on Automated software engineering - ASE '14  
Our experiments show that incremental symbolic execution based on dynamic analysis is an order of magnitude faster than running complete standard symbolic execution on the new version of code.  ...  In this work, we aim to efficiently apply symbolic execution in increments based on versions of code.  ...  Or, in other words, our incremental symbolic execution can explore the program up to a deeper depth bound in the same time due to the time saved by incremental execution.  ... 
doi:10.1145/2642937.2642961 dblp:conf/kbse/MakhdoomKS14 fatcat:6mvcgrhwcvbn5eyt2eg4jwz6tu

High-level real-time programming in Java

David F. Bacon, Martin T. Vechev, Perry Cheng, David Grove, Michael Hind, V. T. Rajan, Eran Yahav, Matthias Hauswirth, Christoph M. Kirsch, Daniel Spoonhower
2005 Proceedings of the 5th ACM international conference on Embedded software - EMSOFT '05  
Real-time systems have reached a level of complexity beyond the scaling capability of the low-level or restricted languages traditionally used for real-time programming.  ...  The goal of our research is the creation of a comprehensive Java-based programming environment and methodology for the creation of complex real-time systems.  ...  INTRODUCTION Real-time systems are rapidly becoming both more complex and more pervasive. Traditional real-time programming methodologies have revolved around relatively simple systems.  ... 
doi:10.1145/1086228.1086242 dblp:conf/emsoft/BaconCGHRYHKSV05 fatcat:z37bw5vr7jcwfn5vsycbcafn7y

A novel processor architecture with exact tag-free pointers

M. Meyer
2004 IEEE Micro  
Performance measurements on the prototype show that, despite the required synchronization, the real-time hardware garbage collector is significantly more efficient than a non-incremental "stop-the-world  ...  The advantages of this configuration include low garbage collection overhead, low-cost synchronization of collector and application program, high robustness and hard real-time capabilities.  ...  Furthermore, multi-threaded and real-time environments must ensure that suspended threads reach the next gc-point within a bounded amount of time.  ... 
doi:10.1109/mm.2004.2 fatcat:xikhleq4ffhdrmpivhsrfwykqa

A Brief Survey on Distributed Graph Algorithms for Shortest Distance

2021 Zenodo  
the running time performance on the several datasets.  ...  In several modern applications the graph in query is altering over time, and to avoid rerunning algorithm on the entire graph every time a small change occurs.  ...  The following time complexity results are presented: (1) The incremental APSP algorithm runs in O(n 2 ) time n 2 ) is the theoretical lower bound of the APSP problem), (2) The incremental closeness algorithm  ... 
doi:10.5281/zenodo.4738503 fatcat:jdpvyh3ujbdqpo3ca2kci3ypw4
« Previous Showing results 1 — 15 out of 119,074 results