Výsledky vyhledávání - "approximate decision algorithms"

Approximate decision algorithms for point set congruence

Autoři: Schirra, S. Heffernan, P.

Zdroj: Computational Geometry

Témata: Control and Optimization, point matching, approximate decision algorithms, 0102 computer and information sciences, 02 engineering and technology, Point matching, 01 natural sciences, Computational geometry, computer vision, Computer Science Applications, Computational Mathematics, Approximate decision algorithms, Computational Theory and Mathematics, network flows, Computer graphics, computational geometry (digital and algorithmic aspects), Network flows, computational geometry, 0202 electrical engineering, electronic engineering, information engineering, Computer vision, Geometry and Topology

Popis souboru: application/xml

Přístupová URL adresa: https://ecommons.cornell.edu/bitstream/1813/8864/1/TR000979.pdf
https://zbmath.org/612130
https://doi.org/10.1016/0925-7721(94)90004-3
https://www.sciencedirect.com/science/article/pii/0925772194900043
https://dblp.uni-trier.de/db/journals/comgeo/comgeo4.html#HeffernanS94
http://dblp.uni-trier.de/db/journals/comgeo/comgeo4.html#HeffernanS94
https://core.ac.uk/display/82704652
https://pure.mpg.de/pubman/faces/ViewItemOverviewPage.jsp?itemId=item_1834993
https://dblp.uni-trier.de/db/conf/compgeom/compgeom92.html#HeffernanS92
https://dl.acm.org/doi/10.1145/142675.142697
http://pubman.mpdl.mpg.de/pubman/item/escidoc:1834993
http://hdl.handle.net/21.11116/0000-000E-14A4-2

Schedulability of event-driven code blocks in real-time embedded systems

Autoři: Lothar Thiele Samarjit Chakraborty Simon Künzli a další

Zdroj: Proceedings of the 39th conference on Design automation - DAC '02. :616

Témata: 0202 electrical engineering, electronic engineering, information engineering, approximate decision algorithms, control flow graph, demand-bound function, dynamic programming, event-driven code block schedulability, exact necessary sufficient conditions, hard real-time constraints, independently executing event-driven code blocks, network processors, nonpreemptive environment, pseudo-polynomial time algorithm, real-time embedded systems, schedulability analysis problem, embedded systems, flow graphs, polynomial approximation, processor scheduling, 02 engineering and technology, ddc

Přístupová URL adresa: https://www.research-collection.ethz.ch/bitstream/20.500.11850/147665/1/eth-26708-01.pdf
http://www.tik.ee.ethz.ch/file/9296c62e682bb8056c7207a18fba36fb/DAC02a.pdf
http://www.cecs.uci.edu/~papers/compendium94-03/papers/2002/dac02/pdffiles/40_1.pdf
https://ieeexplore.ieee.org/document/1012699/
https://dblp.uni-trier.de/db/conf/dac/dac2002.html#ChakrabortyEKT02
https://mediatum.ub.tum.de/1163192

Schedulability of event-driven code blocks in real-time embedded systems

Autoři: Chakraborty, S. Erlebach, T. Kunzli, S. a další

Témata: info:eu-repo/classification/ddc, approximate decision algorithms, control flow graph, demand-bound function, dynamic programming, event-driven code block schedulability, exact necessary sufficient conditions, hard real-time constraints, independently executing event-driven code blocks, network processors, nonpreemptive environment, pseudo-polynomial time algorithm, real-time embedded systems, schedulability analysis problem, embedded systems, flow graphs, polynomial approximation, processor scheduling

Relation: https://mediatum.ub.tum.de/1163192

Dostupnost: https://mediatum.ub.tum.de/1163192
https://doi.org/10.1109/DAC.2002.1012699