Výsledky vyhľadávania - "Nondeterministic algorithms"

Holistic Review of UAV-Centric Situational Awareness: Applications, Limitations, and Algorithmic Challenges

Autori: Somaiyeh MahmoudZadeh Amirmehdi Yazdani Yashar Kalantari a ďalší

Zdroj: Robotics, Vol 13, Iss 8, p 117 (2024)

Predmety: UAV and situational awareness, multi-agent, supervised machine learning, reinforcement learning, deterministic and nondeterministic algorithms, evolutionary and metaheuristics, Mechanical engineering and machinery, TJ1-1570

Relation: https://www.mdpi.com/2218-6581/13/8/117; https://doaj.org/toc/2218-6581; https://doaj.org/article/9f4a4f30a42147059a1129bb5c754637

Dostupnosť: https://doi.org/10.3390/robotics13080117
https://doaj.org/article/9f4a4f30a42147059a1129bb5c754637

Using Nondeterminism to Design Efficient Deterministic Algorithms: Using nondeterminism to design efficient deterministic algorithms

Autori: Jianer Chen Weijia Jia Donald K. Firesen a ďalší

Zdroj: Lecture Notes in Computer Science ISBN: 9783540430025

Predmety: Three-dimensional matching, Parameterized algorithms, Analysis of algorithms and problem complexity, General topics in the theory of algorithms, 0202 electrical engineering, electronic engineering, information engineering, Analysis of algorithms, Nondeterministic algorithms, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/2104933
https://doi.org/10.1007/s00453-004-1096-z
https://link.springer.com/chapter/10.1007/3-540-45294-X_11
https://link.springer.com/10.1007%2F3-540-45294-X_11
https://link.springer.com/chapter/10.1007/3-540-45294-X_11
https://rd.springer.com/chapter/10.1007%2F3-540-45294-X_11
https://link.springer.com/content/pdf/10.1007%2Fs00453-004-1096-z.pdf
https://core.ac.uk/display/21126198
http://core.ac.uk/display/21126198
http://facweb.cs.depaul.edu/ikanj/papers/Latex/3d-matching/Algorithmica/paper.pdf

Dynamic programming on a functional memory computer

Autori: R. Halverson Art Lew

Zdroj: Computers & Mathematics with Applications. 37:17-22

Predmety: dynamic programming, Network design and communication in computer systems, parallel processing, nondeterministic algorithms, Decision tables, 02 engineering and technology, Reconfigurable combinatorial logic, Dynamic programming, 01 natural sciences, Computational Mathematics, reconfigurable combinatorial logic, Computational Theory and Mathematics, Modelling and Simulation, decision tables, 0103 physical sciences, Parallel processing, 0202 electrical engineering, electronic engineering, information engineering, Hawaii parallel computer, Nondeterministic algorithms, Performance evaluation, queueing, and scheduling in the context of computer systems

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/1391593
https://doi.org/10.1016/s0898-1221(99)00138-8
http://www.sciencedirect.com/science/article/pii/S0898122199001388
https://www.sciencedirect.com/science/article/pii/S0898122199001388

Fast nondeterministic matrix multiplication via derandomization of Freivalds' algorithm (Revised corrected version)

Autori: Wiedermann, Jiří

Predmety: modular arithmetic, matrix multiplication, verification of matrix product, nondeterministic algorithms, complexity

Popis súboru: application/pdf

Dostupnosť: http://www.nusl.cz/ntk/nusl-177654

Fast nondeterministic matrix multiplication via derandomization of Freivalds' algorithm (Revised corrected version)

Autori: Wiedermann, J. (Jiří)

Predmety: matrix multiplication, verification of matrix product, nondeterministic algorithms, modular arithmetic, complexity

Relation: http://hdl.handle.net/11104/0239033

Dostupnosť: http://hdl.handle.net/11104/0239033

APPLYING GENETIC ALGORITHM IN SCHEDULING

Autori: Majdandžić, Niko Šarić, Tomislav Brnadić, Ilica a ďalší

Prispievatelia: Majdandžić, Niko Šarić, Tomislav Brnadić, Ilica a ďalší

Predmety: scheduling, nondeterministic algorithms, genetic algorithms, optimization

Prístupová URL adresa: https://www.bib.irb.hr/283708

Complexity Classes for Partial Functions: Complexity classes for partial functions

Autori: Selman, Alan L.

Zdroj: Current Trends in Theoretical Computer Science ISBN: 9789810214623

Predmety: complexity classes of sets, nondeterministic algorithms, Complexity classes (hierarchies, relations among complexity classes, etc.), complexity classes of functions, multivalued functions

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/58287

A mathematical semantics for a nondeterministic typed λ-calculus: A mathematical semantics for a nondeterministic typed lambda-calculus

Autori: Matthew Hennessy Edward A. Ashcroft

Zdroj: Theoretical Computer Science. 11:227-245

Predmety: semantics of nondeterministic algorithms, 0202 electrical engineering, electronic engineering, information engineering, Combinatory logic and lambda calculus, lambda calculus, 0102 computer and information sciences, 02 engineering and technology, Algorithms in computer science, 01 natural sciences, Abstract data types, algebraic specification, Theoretical Computer Science, Computer Science(all)

Popis súboru: application/xml

Prístupová URL adresa: https://dblp.uni-trier.de/db/journals/tcs/tcs11.html#HennessyA80
https://core.ac.uk/display/82798565
https://www.sciencedirect.com/science/article/pii/0304397580900158
https://www.sciencedirect.com/science/article/pii/0304397580900158#!

On the Accepting Density Hierarchy in NP: On the accepting density hierarchy in NP

Autori: Shlomo Moran

Zdroj: SIAM Journal on Computing. 11:344-349

Predmety: 0106 biological sciences, algorithms with oracles, Analysis of algorithms and problem complexity, nondeterministic algorithms, 0102 computer and information sciences, probabilistic algorithms, Algorithms in computer science, 01 natural sciences

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/3752214
https://doi.org/10.1137/0211026
https://epubs.siam.org/doi/10.1137/0211026
https://doi.org/10.1137/0211026
https://dblp.uni-trier.de/db/journals/siamcomp/siamcomp11.html#Moran82

Identical transformations in algebras of nondeterministic algorithms. I

Autori: Yu. A. Yushchenko

Zdroj: Cybernetics. 21:726-735

Predmety: nondeterminism, nondeterministic polynomials, algebra of algorithms, 0211 other engineering and technologies, algebras of nondeterministic algorithms, General topics in the theory of software, axiomatization, 02 engineering and technology, 0101 mathematics, Algorithms in computer science, 01 natural sciences, Abstract data types, algebraic specification

Popis súboru: application/xml

Prístupová URL adresa: https://link.springer.com/article/10.1007/BF01069413

Concurrent applicative implementations of nondeterministic algorithms

Autori: Richard Salter

Zdroj: Computer Languages. 8:61-68

Predmety: multisets, multiprocessing, nondeterministic algorithms, 0202 electrical engineering, electronic engineering, information engineering, concurrency, 02 engineering and technology, applicative languages, Algorithms in computer science, suspended structures, Theory of operating systems

Popis súboru: application/xml

Prístupová URL adresa: https://www.sciencedirect.com/science/article/pii/0096055183900292
https://dblp.uni-trier.de/db/journals/cl/cl8.html#Salter83

Navigating in the Cayley graphs of \(\text{SL}_N(\mathbb{Z})\) and \(\text{SL}_N(\mathbb{F}_p)\).

Autori: Riley, T. R.

Predmety: Generators, relations, and presentations of groups, Unimodular groups, congruence subgroups (group-theoretic aspects), matrix norms, Linear algebraic groups over finite fields, nondeterministic algorithms, finite generating sets, word metrics, Discrete subgroups of Lie groups, Symbolic computation and algebraic computation, special linear groups, Euclidean algorithm, Cayley graphs

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/2227552

A note on hardness of multiprocessor scheduling with scheduling solution space tree

Autori: Dwibedy, Debasis Mohanty, Rakesh

Predmety: combinatorial structures, computational complexity, hardness, makespan, multiprocessor scheduling, multiuser, NP-completeness, nondeterministic algorithms, reduction, scheduling solution space tree

Prístupová URL adresa: http://yadda.icm.edu.pl/baztech/element/bwmeta1.element.baztech-e558fc68-8e1e-4972-912e-2da0640d9e4e

Weryfikacja temporalnych własności algorytmów niedeterministycznychVerification of temporal properties of nondeterministic algorithms

Autori: Kacprzak, M.

Predmety: algorytmy niedeterministyczne, własności temporalne, Temporalna Logika Procesów, nondeterministic algorithms, temporal properties, Process Temporal Logic

Prístupová URL adresa: http://yadda.icm.edu.pl/baztech/element/bwmeta1.element.baztech-article-BPB2-0004-0059