Results 21 to 30 of about 516,631 (319)
Mutation testing from probabilistic finite state machines [PDF]
, 2007 Mutation testing traditionally involves mutating a program in order to produce a set of mutants and using these mutants in order to either estimate the effectiveness of a test suite or to drive test generation.
Hierons, RM, Merayo, MG
core +1 more source
Fast Adaptive Character Animation Synthesis Based on Greedy Algorithm
Complexity, 2021 On the premise of ensuring the animation effect and real-time performance, it is of great significance and value for large-scale group character animation synthesis how to reduce the disaster coincidence degree among various models of fast adaptive ...
Yanqiu Zhu +3 more
doaj +1 more source
Testing from a nondeterministic finite state machine using adaptive state counting [PDF]
, 2004 The problem of generating a checking experiment from a nondeterministic finite state machine has been represented in terms of state counting. However, test techniques that use state counting traditionally produce preset test suites.
Hierons, RM
core +1 more source
DESIGN OF A SOFTWARE SYSTEM FOR FINITE STATE MACHINE (FSM)
Diyala Journal of Engineering Sciences, 2011 There are several ways used to represent the circuits and system operations for design and analyses. Finite state machine (FSM) is one of the ways that used for representing the operations of many circuits and systems in electronic engineering, computer
Hussein Abdulameer Abdulkadhim
doaj +1 more source
Finite State Machine-Based Motion-Free Learning of Biped Walking
IEEE Access, 2021 Recently, deep reinforcement learning (DRL) is commonly used to create controllers for physically simulated characters. Among DRL-based approaches, imitation learning for character control using motion capture clips as tracking references has shown ...
Gyoo-Chul Kang, Yoonsang Lee
doaj +1 more source
Controllable testing from nondeterministic finite state machines with multiple ports [PDF]
, 2011 Copyright @ 2011 IEEESome systems have physically distributed interfaces, called ports, at which they interact with their environment. We place a tester at each port and if the testers cannot directly communicate and there is no global clock then we are ...
Hierons, RM
core +1 more source
, 2017 Robots have embedded computers with memory that can be used to store the current state of an algorithm. Finite state machines specify the conditions under which the state of the robot changes and the actions taken when the state changes. Finite state machines are demonstrated first by Braitenberg vehicles and then by an algorithm that causes the robot ...
Mordechai Ben-Ari, Francesco Mondada
openaire +2 more sources
A representer theorem for deep kernel learning [PDF]
, 2018 In this paper we provide a finite-sample and an infinite-sample representer theorem for the concatenation of (linear combinations of) kernel functions of reproducing kernel Hilbert spaces.
Bohn, Bastian +2 more
core +2 more sources
Multi-Robot Remote Interaction with FS-MAS
International Journal of Advanced Robotic Systems, 2013 The need to reduce bandwidth, improve productivity, autonomy and the scalability in multi-robot teleoperation has been recognized for a long time. In this article we propose a novel finite state machine mobile agent based on the network interaction ...
Yunliang Jiang +5 more
doaj +1 more source
STRUCTURAL STATE MACHINES IN THE FORM OF THE TENSORS OF THE THIRD RANK SUDOKU TYPE
Радіоелектронні і комп'ютерні системи, 2019 The construction concept and general principles of the operation of a new kind of finite state machine are presented, for which the input and output elements are panels of square matrices, and the transitions between their states are determined by ...
Юрий Михайлович Пенкин +1 more
doaj +1 more source