Search results

Since the early 1961s computer systems have been able to simulate real-world dynamic situations, such as the interaction between people in a public building suc |title=Continuous-system simulation languages: A state-of-the-art survey|publisher=Elsevier Science Publishers B. V. Amst ...

===Dynamic programming=== ...ubgraphs of this type, finding the solution to each subgraph using dynamic programming, and gluing the solutions together. ...

...ceedings of the seventh ACM SIGPLAN international conference on Functional programming|pages=26–35|publisher=[[Association for Computing Machinery|ACM]]|yea ...e 26th ACM International Conference on Object-Oriented Programming Systems Languages and Applications (OOPSLA 2011)|pages=407–426|publisher=[[Association ...

...n Willard]] created it in 1990 to simulate programming languages like [[C (programming language)|C]].<ref name="Fredman90">{{cite journal|last1=Fredman|first1=Mic ...journal |last1=Andersson |first1=Arne |last2=Thorup |first2=Mikkel |title=Dynamic ordered sets with exponential search trees |journal=Journal of the ACM |dat ...

...iswanathan | first4=Mahesh | journal=Proceedings of the ACM on Programming Languages | volume=7 | pages=1733–1758 | arxiv=2304.03692 }}</ref> * [[Atomicity (programming)|Atomicity]] violations<ref>{{cite web |url=http://umathur3.web.engr.illino ...

{{Infobox programming language ...radigm = [[Imperative programming|imperative]] ([[Procedural programming|procedural]]), [[Reversible computing|reversible]] ...

...am analysis]]. Given a graph with edge labels from some [[Alphabet (formal languages)|alphabet]] and a [[context-free grammar]] over that alphabet, the problem There is a relatively simple [[dynamic programming]] algorithm for solving all-pairs CFL-reachability. The algorithm requires ...

Let <math>L</math> be the set of words over the [[Alphabet (formal languages)|alphabet]] {''a'',''b''} whose ''n''th last letter is an <math>a</math>. T Let ''A'' and ''B'' be two UFAs. Let ''L''(''A'') and ''L''(''B'') be the languages accepted by those automata. Then ''L''(''A'')⊆''L''(''B'') if and only if ' ...

{{Main article|Racket (programming language)}} ...both [[domain-specific language]]s and completely new languages.<ref name="languages-as-libraries">{{cite conference ...

...g]] (NLP), [[Mixed integer programming]] (MIP), and [[Mixed integer linear programming]] (MILP). GEKKO is available in Python and installed with pip from PyPI of ...Vol. 187, Springer 1981.</ref> used to test the performance of [[nonlinear programming]] solvers. This particular optimization problem has an objective function < ...

In [[computer science]], '''dynamic software updating''' ('''DSU''') is a field of research pertaining to [[upg Current operating systems and programming languages are typically not designed with DSU in mind. As such, DSU implementations c ...

...Dynamic Semantics |url=https://plato.stanford.edu/archives/win2016/entries/dynamic-semantics/ |access-date=2020-08-11 |year=2016}}</ref> ...y |title=Anaphora |url=https://plato.stanford.edu/archives/win2016/entries/dynamic-semantics/ |access-date=2020-08-11 |year=2018}}</ref> ...

...//www.microstrategy.com/Software/Products/Service_Modules/Report_Services/ Dynamic Dashboards]}} ==APIs and query languages== ...

| title = Proc. Int. Coll. Automata, Languages and Programming (ICALP 2004) # Apply [[dynamic programming]] to this path decomposition to find a longest path in time <math>O(d!2^dn) ...

...g contrasts with ''work sharing'', another popular scheduling approach for dynamic multithreading, where each work item is scheduled onto a processor when it ...0.1145/1639949.1640106 |citeseerx=10.1.1.146.4197 }}</ref> and the [[Rust (programming language)|Rust]] [[Tokio (software)|Tokio runtime]].<ref>{{Cite web|title=W ...

...struct a [[tree decomposition]] with bounded width, and standard [[dynamic programming]] techniques for graphs of bounded treewidth can be used to compute the dep ...Programming|Proc. 35th International Colloquium on Automata, Languages and Programming]] ...

'''Bayesian programming''' is a formalism and a methodology for having a technique to specify [[Pro ...=Juan |last3=Manuel Ahuactzin|first4=Kamel |last4=Mekhnacha|title=Bayesian Programming|url={{google books |plainurl=y |id=4XtcAgAAQBAJ}}|date=20 December 2013|pub ...

...ridge Research Laboratory |location=Bedford, MA}}</ref> which is a dynamic programming algorithm which constructs a parse in worst-case <math>\mathcal{O}\left( n^ ...ast1=Booth |first1=Taylor L. |title=Probabilistic representation of formal languages |conference=10th Annual Symposium on Switching and Automata Theory |date=19 ...

...bination of [[array programming]], higher-order function, and [[functional programming]], and are a major distinguishing advance of early 21st century APL over pr ..." puzzle:<ref name=Bentley1983>{{cite journal|last=Bentley|first=Jon|title=Programming Pearls|journal=[[Communications of the ACM]]|volume=26|number=8 and 9|date= ...

...ns of [[Finite-state machine|finite-state-machine]]-based [[automata-based programming]]. If there are several hierarchical levels of control table they may behav ...n position in the [[association list]]. Control tables reduce the need for programming similar [[data structures|structures]] or program statements over and over ...