Search results for "MCU"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
132	Junlin Li, Li-wei He, Dinei A. F. Florêncio	Multi-Party Audio Conferencing Based on a Simpler MCU and Client-Side ECHO Cancellation.	ICME	2007	DBLP DOI BibTeX RDF
128	Toshiyuki Kawasaki, Koji Okamura	Evaluation on Scalability of Conference System using Request-Routing.	AINA (1)	2004	DBLP DOI BibTeX RDF
84	Yunfei Bai, Chng Eng Siong, Gorthi Prashant Bhanu	An MCU description methodology for initialization code generation software.	ICPADS	2007	DBLP DOI BibTeX RDF
59	Satoru Tokuhisa, Takaaki Ishizawa, Yoshimasa Niwa, Kenji Kasuya, Atsuro Ueki, Sho Hashimoto, Kazuhiko Koriyama, Masa Inakage	xtel: a development environment to support rapid prototyping of "ubiquitous content".	TEI	2009	DBLP DOI BibTeX RDF	ubiquitous computing, prototyping, P2P, VM, MCU
59	Jen-Chun Chang, Wanjiun Liao	Application-Layer Conference Trees for Multimedia Multipoint Conferences Using Megaco/H.248.	ICME	2001	DBLP DOI BibTeX RDF	Megaco/H.248, multipoint conference, conference tree, MCU
58	Charalambos Skianis, Kimon P. Kontovasilis, Athanasios Drigas, M. Moatsos	Measurement and Statistical Analysis of Asymmetric Multipoint Videoconference Traffic in IP Networks.	Telecommun. Syst.	2003	DBLP DOI BibTeX RDF	videoconference systems, video bridging, multipoint control units (MCU), H.261 video coding, IP-traffic measurements, traffic modeling
48	Lew Boon Kian	Test Cost Saving and Challenges in the Implementation of x6 and x8 Parallel Testing on Freescale 16-bit HCS12 Micro-controller Product Family.	DELTA	2006	DBLP DOI BibTeX RDF
48	Wanjiun Liao, Jen-Chun Chang, Victor O. K. Li	Application-Layer conference trees for multimedia multipoint conferences using megaco/H.248.	IEEE Trans. Multim.	2005	DBLP DOI BibTeX RDF
48	Bill Huston	Single-chip microcomputers can be easy to program.	AFIPS National Computer Conference	1982	DBLP DOI BibTeX RDF
47	Nan Xie, Haibo Zhang, Shenyong Gao, Yan Ma, Weimin Chen	Development of Online Measuring Instrument for Water-in-Oil percentage Based on MCU.	IFITA (3)	2009	DBLP DOI BibTeX RDF	water-in-oil percentage, XE2004, capacitance to voltage convention, online measurement, MCU
43	Kai Qian, Jigang Liu, Lixin Tao	Teach real-time embedded system online with real hands-on labs.	ITiCSE	2009	DBLP DOI BibTeX RDF	real time, embedded, portable, engineering, MCU
43	Jérôme Durand-Lose, György Vaszil (eds.)	Machines, Computations, and Universality - 9th International Conference, MCU 2022, Debrecen, Hungary, August 31 - September 2, 2022, Proceedings	MCU	2022	DBLP DOI BibTeX RDF
43	Petr Sosík, Jan Drastík	Computational Universality and Efficiency in Morphogenetic Systems.	MCU	2022	DBLP DOI BibTeX RDF
43	Lucie Ciencialová, Ludek Cienciala, Erzsébet Csuhaj-Varjú	Languages of Distributed Reaction Systems.	MCU	2022	DBLP DOI BibTeX RDF
43	Erik D. Demaine, Robert A. Hearn, Dylan H. Hendrickson, Jayson Lynch	PSPACE-Completeness of Reversible Deterministic Systems.	MCU	2022	DBLP DOI BibTeX RDF
43	Manon Blanc, Olivier Bournez	A Characterization of Polynomial Time Computable Functions from the Integers to the Reals Using Discrete Ordinary Differential Equations.	MCU	2022	DBLP DOI BibTeX RDF
43	David Orellana-Martín, Luis Valencia-Cabrera, Mario J. Pérez-Jiménez	P Systems with Evolutional Communication and Separation Rules.	MCU	2022	DBLP DOI BibTeX RDF
43	Artiom Alhazov, Rudolf Freund, Sergiu Ivanov 0001, Sergey Verlan	Prescribed Teams of Rules Working on Several Objects.	MCU	2022	DBLP DOI BibTeX RDF
43	Bianca Truthe	A Survey on Computationally Complete Accepting and Generating Networks of Evolutionary Processors.	MCU	2022	DBLP DOI BibTeX RDF
43	Enrico Formenti	Complexity of Local, Global and Universality Properties in Finite Dynamical Systems.	MCU	2022	DBLP DOI BibTeX RDF
43	Viktor Olejár, Alexander Szabari	Closure Properties of Subregular Languages Under Operations.	MCU	2022	DBLP DOI BibTeX RDF
43	Benedek Nagy	From Finite Automata to Fractal Automata - The Power of Recursion.	MCU	2022	DBLP DOI BibTeX RDF
43	Bogdan Aman	From Networks of Reaction Systems to Communicating Reaction Systems and Back.	MCU	2022	DBLP DOI BibTeX RDF
43	Aleksandr S. Tvardovskii, Nina Yevtushenko 0001	Adaptive Experiments for State Identification in Finite State Machines with Timeouts.	MCU	2022	DBLP DOI BibTeX RDF
43	Jérôme Durand-Lose, Sergey Verlan (eds.)	Machines, Computations, and Universality - 8th International Conference, MCU 2018, Fontainebleau, France, June 28-30, 2018, Proceedings	MCU	2018	DBLP DOI BibTeX RDF
43	Rudolf Freund	Control Mechanisms for Array Grammars on Cayley Grids.	MCU	2018	DBLP DOI BibTeX RDF
43	Kévin Perrot, Pacôme Perrotin, Sylvain Sené	A Framework for (De)composing with Boolean Automata Networks.	MCU	2018	DBLP DOI BibTeX RDF
43	Cosmin Bonchis, Gabriel Istrate, Vlad Rochian	The Language (and Series) of Hammersley-Type Processes.	MCU	2018	DBLP DOI BibTeX RDF
43	Viliam Geffert, Zuzana Bednárová	Minimal Useful Size of Counters for (Real-Time) Multicounter Automata.	MCU	2018	DBLP DOI BibTeX RDF
43	Henning Fernau, Lakshmanan Kuppusamy, Rufus O. Oladele, Indhumathi Raman	Minimizing Rules and Nonterminals in Semi-conditional Grammars: Non-trivial for the Simple Case.	MCU	2018	DBLP DOI BibTeX RDF
43	Richard Whyman	Physical Computation and First-Order Logic.	MCU	2018	DBLP DOI BibTeX RDF
43	Artiom Alhazov, Rudolf Freund, Sergiu Ivanov 0001	Sequential Grammars with Activation and Blocking of Rules.	MCU	2018	DBLP DOI BibTeX RDF
43	Benedek Nagy, Sándor Vályi	An Extension of Interval-Valued Computing Equivalent to Red-Green Turing Machines.	MCU	2018	DBLP DOI BibTeX RDF
43	Michel Raynal, Jiannong Cao 0001	A Pleasant Stroll Through the Land of Distributed Machines, Computation, and Universality.	MCU	2018	DBLP DOI BibTeX RDF
43	Jérôme Durand-Lose, Benedek Nagy (eds.)	Machines, Computations, and Universality - 7th International Conference, MCU 2015, Famagusta, North Cyprus, September 9-11, 2015, Proceedings	MCU	2015	DBLP DOI BibTeX RDF
43	Timo Jolivet, Anne Siegel	Decidability Problems for Self-induced Systems Generated by a Substitution.	MCU	2015	DBLP DOI BibTeX RDF
43	Martin Kutrib, Matthias Wendlandt	Reversible Limited Automata.	MCU	2015	DBLP DOI BibTeX RDF
43	Henning Fernau, Rudolf Freund, Rani Siromoney, K. G. Subramanian 0001	Non-isometric Contextual Array Grammars with Regular Control and Local Selectors.	MCU	2015	DBLP DOI BibTeX RDF
43	Martin Kutrib, Andreas Malcher, Matthias Wendlandt	Tinput-Driven Pushdown Automata.	MCU	2015	DBLP DOI BibTeX RDF
43	Frank Drewes, Markus Holzer 0001, Sebastian Jakobi, Brink van der Merwe	Tight Bounds for Cut-Operations on Deterministic Finite Automata.	MCU	2015	DBLP DOI BibTeX RDF
43	Mike Stannett	Towards Formal Verification of Computations and Hypercomputations in Relativistic Physics.	MCU	2015	DBLP DOI BibTeX RDF
43	Benedek Nagy, Sándor Vályi	A Characterization of NP Within Interval-Valued Computing.	MCU	2015	DBLP DOI BibTeX RDF
43	Simon Martiel, Bruno Martin	An Intrinsically Universal Family of Causal Graph Dynamics.	MCU	2015	DBLP DOI BibTeX RDF
43	Sergiu Ivanov 0001, Sergey Verlan	Universality of Graph-controlled Leftist Insertion-deletion Systems with Two States.	MCU	2015	DBLP DOI BibTeX RDF
43	Dmitry A. Zaitsev	Universality in Infinite Petri Nets.	MCU	2015	DBLP DOI BibTeX RDF
43	Jacob Hendricks, Matthew J. Patitz, Trent A. Rogers	The Simulation Powers and Limitations of Hierarchical Self-Assembly Systems.	MCU	2015	DBLP DOI BibTeX RDF
43	Erzsébet Csuhaj-Varjú, Rudolf Freund, György Vaszil	A Connection Between Red-Green Turing Machines and Watson-Crick T0L Systems.	MCU	2015	DBLP DOI BibTeX RDF
43	Turlough Neary, Matthew Cook 0001 (eds.)	Proceedings Machines, Computations and Universality 2013, MCU 2013, Zürich, Switzerland, September 9-11, 2013.	MCU	2013	DBLP DOI BibTeX RDF
43	Rudolf Freund, Gheorghe Paun	How to Obtain Computational Completeness in P Systems with One Catalyst.	MCU	2013	DBLP DOI BibTeX RDF
43	Niall Murphy, Damien Woods	AND and/or OR: Uniform Polynomial-Size Circuits	MCU	2013	DBLP DOI BibTeX RDF
43	Damien Woods	Intrinsic universality and the computational power of self-assembly.	MCU	2013	DBLP DOI BibTeX RDF
43	Rudolf Freund, Sergiu Ivanov 0001, Marion Oswald, K. G. Subramanian 0001	One-dimensional Array Grammars and P Systems with Array Insertion and Deletion Rules.	MCU	2013	DBLP DOI BibTeX RDF
43	Christian Herrmann 0003, Johanna Sokoli, Martin Ziegler 0001	Satisfiability of cross product terms is complete for real nondeterministic polytime Blum-Shub-Smale machines.	MCU	2013	DBLP DOI BibTeX RDF
43	Dmitry A. Zaitsev	A Small Universal Petri Net.	MCU	2013	DBLP DOI BibTeX RDF
43	Maurice Margenstern, K. G. Subramanian 0001	Hyperbolic tilings and formal language theory.	MCU	2013	DBLP DOI BibTeX RDF
43	Nathalie Aubrun, Jarkko Kari	Tiling Problems on Baumslag-Solitar groups.	MCU	2013	DBLP DOI BibTeX RDF
43	Anthony Gasperin	Topology and Non-Deterministic Polynomial Time Computation : Avoidance of The Misbehaviour of Hub-Free Diagrams and Consequences.	MCU	2013	DBLP DOI BibTeX RDF
43	Jacob Hendricks, Matthew J. Patitz	On the Equivalence of Cellular Automata and the Tile Assembly Model.	MCU	2013	DBLP DOI BibTeX RDF
43	Maurice Margenstern	About Strongly Universal Cellular Automata	MCU	2013	DBLP DOI BibTeX RDF
43	Kenichi Morita	Reversible Logic Elements with Memory and Their Universality.	MCU	2013	DBLP DOI BibTeX RDF
43	Simon Martiel, Bruno Martin	Intrinsic Universality of Causal Graph Dynamics.	MCU	2013	DBLP DOI BibTeX RDF
43	Jérôme Olivier Durand-Lose, Maurice Margenstern (eds.)	Machines, Computations, and Universality, 5th International Conference, MCU 2007, Orléans, France, September 10-13, 2007, Proceedings	MCU	2007	DBLP DOI BibTeX RDF
43	Dorothea Baumeister, Jörg Rothe	Satisfiability Parsimoniously Reduces to the TantrixTM Rotation Puzzle Problem.	MCU	2007	DBLP DOI BibTeX RDF	rotation puzzle, tiling of the plane, parsimonious reduction, computational complexity, counting problem
43	Juan Castellanos, Florin Manea, Luis Fernando de Mingo López, Victor Mitrana	Accepting Networks of Splicing Processors with Filtered Connections.	MCU	2007	DBLP DOI BibTeX RDF
43	Joel David Hamkins	A Survey of Infinite Time Turing Machines.	MCU	2007	DBLP DOI BibTeX RDF
43	Hidenosuke Nishio	Changing the Neighborhood of Cellular Automata.	MCU	2007	DBLP DOI BibTeX RDF	reversi- bility, simulator, cellular automaton, neighborhood, decision problem
43	John Fisher, Marc Bezem	Query Completeness of Skolem Machine Computations.	MCU	2007	DBLP DOI BibTeX RDF
43	Andrew Adamatzky	Encapsulating Reaction-Diffusion Computers.	MCU	2007	DBLP DOI BibTeX RDF
43	Turlough Neary, Damien Woods	Four Small Universal Turing Machines.	MCU	2007	DBLP DOI BibTeX RDF
43	K. G. Subramanian 0001	P Systems and Picture Languages.	MCU	2007	DBLP DOI BibTeX RDF
43	Frantisek Mráz, Friedrich Otto, Martin Plátek	Hierarchical Relaxations of the Correctness Preserving Property for Restarting Automata.	MCU	2007	DBLP DOI BibTeX RDF
43	Damien Woods, Turlough Neary	Small Semi-weakly Universal Turing Machines.	MCU	2007	DBLP DOI BibTeX RDF
43	Artiom Alhazov, Mario J. Pérez-Jiménez	Uniform Solution of.	MCU	2007	DBLP DOI BibTeX RDF
43	Alexander Okhotin	A Simple P-Complete Problem and Its Representations by Language Equations.	MCU	2007	DBLP DOI BibTeX RDF
43	Jean-Baptiste Yunès	Simple New Algorithms Which Solve the Firing Squad Synchronization Problem: A 7-States 4n-Steps Solution.	MCU	2007	DBLP DOI BibTeX RDF
43	Liesbeth De Mol	Study of Limits of Solvability in Tag Systems.	MCU	2007	DBLP DOI BibTeX RDF	Limits of solvability, Reachability problem, Tag Systems, Halting Problem
43	Hiroshi Umeo, Takashi Yanagihara	A Smallest Five-State Solution to the Firing Squad Synchronization Problem.	MCU	2007	DBLP DOI BibTeX RDF
43	Olivier Bournez, Emmanuel Hainry	On the Computational Capabilities of Several Models.	MCU	2007	DBLP DOI BibTeX RDF
43	Jürgen Dassow, Bianca Truthe	On the Power of Networks of Evolutionary Processors.	MCU	2007	DBLP DOI BibTeX RDF
43	Olivier Teytaud	Slightly Beyond Turing's Computability for Studying Genetic Programming.	MCU	2007	DBLP DOI BibTeX RDF
43	Mark Burgin	Universality, Reducibility, and Completeness.	MCU	2007	DBLP DOI BibTeX RDF	problem completeness, algorithm, computability, reducibility, universal, computing power, problem hardness
43	Pascal Koiran	Decision Versus Evaluation in Algebraic Complexity.	MCU	2007	DBLP DOI BibTeX RDF	Blum-Shub-Smale model, Valiant’s model, computational complexity, algebraic complexity
43	Kenichi Morita, Yoshikazu Yamaguchi	A Universal Reversible Turing Machine.	MCU	2007	DBLP DOI BibTeX RDF	universal Turing machine, cyclic tag system, reversible computing
43	Jarkko Kari	The Tiling Problem Revisited (Extended Abstract).	MCU	2007	DBLP DOI BibTeX RDF
43	Hermann Gruber, Markus Holzer 0001, Martin Kutrib	More on the Size of Higman-Haines Sets: Effective Constructions.	MCU	2007	DBLP DOI BibTeX RDF
43	Artiom Alhazov, Rudolf Freund, Marion Oswald, Sergey Verlan	Partial Halting in P Systems Using Membrane Rules with Permitting Contexts.	MCU	2007	DBLP DOI BibTeX RDF	computational completeness, halting, minimal parallelism, permitting context, P systems
43	Tommaso Bolognesi	Planar Trivalent Network Computation.	MCU	2007	DBLP DOI BibTeX RDF	Digital physics, trivalent network, complexity indicator, two-dimensional Turing machine, turmite, emergent space, cellular automata
43	Manuel Lameiras Campagnolo, Kerry Ojakian	Using Approximation to Relate Computational Classes over the Reals.	MCU	2007	DBLP DOI BibTeX RDF
43	Artiom Matveevici, Yurii Rogozhin, Sergey Verlan	Insertion-Deletion Systems with One-Sided Contexts.	MCU	2007	DBLP DOI BibTeX RDF	insertion-deletion systems, computational non-completeness, universality
43	Maurice Margenstern (eds.)	Machines, Computations, and Universality, 4th International Conference, MCU 2004, Saint Petersburg, Russia, September 21-24, 2004, Revised Selected Papers	MCU	2005	DBLP DOI BibTeX RDF
43	Jérôme Durand-Lose	Abstract Geometrical Computation for Black Hole Computation.	MCU	2004	DBLP DOI BibTeX RDF
43	Markus Holzer 0001, Martin Kutrib	Register Complexity of LOOP-, WHILE-, and GOTO-Programs.	MCU	2004	DBLP DOI BibTeX RDF
43	Juhani Karhumäki	Finite Sets of Words and Computing.	MCU	2004	DBLP DOI BibTeX RDF
43	Kenichi Morita, Tsuyoshi Ogiro, Keiji Tanaka, Hiroko Kato	Classification and Universality of Reversible Logic Elements with One-Bit Memory.	MCU	2004	DBLP DOI BibTeX RDF
43	Chuzo Iwamoto, Naoki Hatayama, Kenichi Morita, Katsunobu Imai, Daisuke Wakamatsu	Hierarchies of DLOGTIME-Uniform Circuits.	MCU	2004	DBLP DOI BibTeX RDF
43	Jean Néraud	Completing a Code in a Regular Submonoid of the Free Monoid.	MCU	2004	DBLP DOI BibTeX RDF
43	Giusi Castiglione, Antonio Restivo	Ordering and Convex Polyominoes.	MCU	2004	DBLP DOI BibTeX RDF
43	Artiom Alhazov, Rudolf Freund, Gheorghe Paun	Computational Completeness of P Systems with Active Membranes and Two Polarizations.	MCU	2004	DBLP DOI BibTeX RDF
43	Olivier Bournez, Emmanuel Hainry	Real Recursive Functions and Real Extensions of Recursive Functions.	MCU	2004	DBLP DOI BibTeX RDF
43	Mario J. Pérez-Jiménez, Francisco José Romero-Campero	Attacking the Common Algorithmic Problem by Recognizer P Systems.	MCU	2004	DBLP DOI BibTeX RDF