Search results

Jump to navigation Jump to search
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • ...|url=http://xlinux.nist.gov/dads/HTML/steinerpoint.html|work=Dictionary of Algorithms and Data Structures|publisher=U.S. National Institute of Standards and Tech ...|A}}}}, {{mvar|L{{sub|B}}}} and {{mvar|L{{sub|C}}}} are [[Concurrent lines|concurrent]]. The point of concurrency is the ''Steiner point'' of triangle {{mvar|ABC ...
    8 KB (1,228 words) - 08:05, 13 May 2024
  • [[Category:Concurrent algorithms]] ...
    1 KB (184 words) - 19:45, 9 February 2024
  • ...a</math>, but the vectors are not identical, then the two vectors must be concurrent. ...with a small set of servers mediating replica access by a large number of concurrent clients. ...
    5 KB (731 words) - 23:21, 9 May 2023
  • ...Parallelism in algorithms and architectures |chapter=Fundamental parallel algorithms for private-cache chip multiprocessors |date=2008|pages=197–206|location=Ne ...Parallelism in algorithms and architectures |chapter=Fundamental parallel algorithms for private-cache chip multiprocessors |date=2008|pages=197–206|location=Ne ...
    16 KB (2,522 words) - 09:49, 16 October 2023
  • ...=Kleene algebra with tests and commutativity conditions |journal=Tools and Algorithms for the Construction and Analysis of Systems |date=March 1996a |volume=1055 *{{cite journal |last1=Pous |first1=Damien |title=Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests |journal=[[POPL]] '1 ...
    7 KB (874 words) - 19:18, 4 February 2025
  • ...[[Petri net]] from a [[transition system]]. As such, it aims at recovering concurrent, independent behavior from transitions between global states. Theory of reg <!--- Often, infinite nets would be obtained, but there are actual algorithms ---> ...
    3 KB (404 words) - 01:47, 15 September 2024
  • ...algorithm|journal=Journal of Algorithms|series=1998 European Symposium on Algorithms|volume=49|issue=1|pages=114–152|doi=10.1016/S0196-6774(03)00076-2|issn=0196 Sequential shortest path algorithms commonly apply iterative labeling methods based on maintaining a tentative ...
    15 KB (2,348 words) - 20:57, 12 October 2024
  • ...e condition#Data race|data races]]) in [[Thread (computing)#Multithreading|concurrent programs]], where a runtime monitor is used to predict errors which did not In the context of [[Thread (computing)#Multithreading|concurrent programs]], a predictive technique is ''sound'' if it only predicts concurr ...
    14 KB (1,820 words) - 22:30, 20 August 2024
  • ...y D.|last2=Singhal|first2=Mukesh|title=Distributed computing : principles, algorithms, and systems|url=https://archive.org/details/distributedsyste00ajay_336|url ...A /> A ''read'' operation of a safe register can return any value if it is concurrent with a Write operation, and returns the value written by the most recent '' ...
    10 KB (1,540 words) - 05:29, 29 September 2024
  • ...ience)|concurrency]] known as parallel independence,<ref name="corradini">"Concurrent computing: from Petri nets to graph grammars", Corradini, Andrea, ENTCS, vo [[Category:Graph algorithms]] ...
    5 KB (733 words) - 20:55, 12 October 2024
  • ...e=Foundations of Computer Science, 1987., 28th Annual Symposium on|chapter=Concurrent reading while writing ii: the multi-writer case|year=1987|pages=383–392}}</ ...r-time snapshot using multi-writer multi-reader registers|work=Distributed Algorithms|date=1994|pages=130–140|doi=10.1007/BFb0020429|publisher=Springer|isbn=978- ...
    25 KB (3,763 words) - 05:51, 18 November 2024
  • ...tps://link.springer.com/article/10.1007/s11554-014-0395-0 Special issue on algorithms and architectures for real-time multi-dimensional image processing]." J. Re mD-DSP algorithms exhibit a large amount of complexity, as described in the previous section, ...
    23 KB (3,522 words) - 16:05, 18 October 2023
  • ...mmodity Max-Flow Min-Cut Theorems and Their Use in Designing Approximation Algorithms |journal=[[Journal of the ACM]] |date=November 1999 |volume=46 |issue=6 |pa ...the max-flow min-cut ratio for directed multicommodity flows |journal=[[J. Algorithms]] |date=1997 |volume=22 |pages=241–269}}</ref><ref name="Garg96">{{cite jou ...
    16 KB (2,406 words) - 20:49, 12 February 2025
  • ...lel algorithm|parallelising]] known [[Minimum_spanning_tree#Algorithms|MST algorithms]].<ref>{{cite book |last1=Sanders |last2=Dietzfelbinger |last3=Martin |last ...anford.edu/~rezab/dao/notes/lecture06/cme323_lec6.pdf |website=Distributed Algorithms and Optimization Stanford University Homepage |access-date=25 February 2019 ...
    19 KB (3,006 words) - 01:04, 31 July 2023
  • Trace alignment techniques do not explicitly handle concurrent tasks nor cyclic behavior (repetition of tasks). If for example four tasks == Notable algorithms == ...
    11 KB (1,835 words) - 12:52, 29 January 2023
  • | title = Specifying Concurrent Systems with TLA<sup>+</sup> ...ning, modelling, documentation, and verification of programs, especially [[concurrent systems]] and [[distributed systems]]. TLA<sup>+</sup> is considered to be ...
    40 KB (5,355 words) - 06:27, 17 January 2025
  • ...building blocks for interaction patterns, that are often used in [[SPMD]] algorithms in the [[parallel programming]] context. Hence, there is an interest in eff ...oadcast ({{section link||Broadcast}}) for example, which allows convenient concurrent read.<ref name=":1">Sanders, Mehlhorn, Dietzfelbinger, Dementiev 2019, p. 3 ...
    22 KB (3,633 words) - 17:40, 9 March 2024
  • ...applied in [[modal logic]] [[method of analytic tableaux|tableau calculi]] algorithms to optimise their efficiency.<ref name="CEGAR-Tableaux">{{cite conference | ...atic Verification of Finite State Systems |book-title=Logics and Models of Concurrent Systems |series=NATO ASI |volume=13 |doi=10.1007/978-3-642-82453-1_1 |doi-a ...
    8 KB (1,111 words) - 03:55, 8 February 2025
  • ...desired computation results with digital signal processors. Hence, better algorithms and hardware architecture are needed to accelerate multidimensional DSP com ...{{math|''M'' × ''M''}} matrices can be processed by {{math|''M'' × ''M''}} concurrent threads on a GPGPU device without any output data dependency. Therefore, th ...
    21 KB (3,037 words) - 00:31, 21 July 2024
  • ...ious methods are used in the representation of the data, as well as in the algorithms that manipulate them.<ref>{{Cite journal |last1=Neut |first1=Sylvain |last2 ...last=Cassidy | title=The Feasibility of Automatic Storage Reclamation with Concurrent Program Execution in a LISP Environment | institution=Naval Postgraduate Sc ...
    25 KB (3,486 words) - 10:12, 8 February 2025
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)