|
|
|
|
|
Mauricio Toro
Pág. 37 - 73
We can program a Real-Time (RT) music improvisation system in C++ without a formal semantic or we can model it with process calculi such as the Non-deterministic Timed Concurrent Constraint (ntcc) calculus. ?A Concurrent Constraints Factor Oracle (FO) mo...
ver más
|
|
|
|
|
|
|
|
|
|
|
Chaonan He, Linqing Zhou and Xinwei Ma
The marine fishery will be the main form of the marine economy in the future. Simulating a hydrodynamic response under normal and extreme working conditions is the main means of structural analysis and design of a mariculture ship. In this paper, a simul...
ver más
|
|
|
|
|
|
|
|
|
|
|
Sílvia de Castro Pereira, Eduardo J. Solteiro Pires and Paulo B. de Moura Oliveira
A new algorithm based on the ant colony optimization (ACO) method for the multiple traveling salesman problem (mTSP) is presented and defined as ACO-BmTSP. This paper addresses the problem of solving the mTSP while considering several salesmen and keepin...
ver más
|
|
|
|
|
|
|
|
|
|
|
Leon Catipovic, Frano Matic, Hrvoje Kalinic, Shubha Sathyendranath, Tomislav ?upanovic, James Dingle and Thomas Jackson
This work represents a modification of the Context Conditional Generative Adversarial Network as a novel implementation of a non-linear gap reconstruction approach of missing satellite-derived chlorophyll a concentration data. By adjusting the loss funct...
ver más
|
|
|
|
|
|
|
|
|
|
|
Casey L. Denham, Mayuresh Patil, Christopher J. Roy and Natalia Alexandrov
Flight testing has been the historical standard for determining aircraft airworthiness. However, increases in the cost of flight testing and the accuracy of inexpensive CFD encourage the adoption of certification by analysis to reduce or replace flight t...
ver más
|
|
|
|
|
|
|
|
|
|
|
Bao Tong, Jianwei Wang, Xue Wang, Feihao Zhou, Xinhua Mao and Wenlong Zheng
The optimal delivery route problem for truck?drone delivery is defined as a traveling salesman problem with drone (TSP-D), which has been studied in a wide range of previous literature. However, most of the existing studies ignore truck waiting time at r...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov
Pág. 1 - 11
This paper discusses (non-deterministic) finite automata of a special kind. We have not found any publications in the literature in Russian that define the title for such automata, so we propose a new name for them, i.e. ?petal automata?. (In the only pu...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov,Aleksandra Melnikova
Pág. 1 - 9
The maximum prefix code is defined in the usual way, ?based on the things stated in the student courses?. An extended maximum prefix code is a finite language containing some maximum prefix code as a subset (proper or improper one). Also the (homo)morphi...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov
Pág. 1 - 10
This paper discusses (non-deterministic) finite automata of a special kind. We have not found any publications in the literature in Russian that define the title for such automata, so we propose a new name for them, i.e. ?petal automata?. (In the only pu...
ver más
|
|
|
|
|
|
|
|
|
|
|
Alon Ascoli, Martin Weiher, Melanie Herzig, Stefan Slesazeck, Thomas Mikolajick and Ronald Tetzlaff
This manuscript provides a comprehensive tutorial on the operating principles of a bio-inspired Cellular Nonlinear Network, leveraging the local activity of NbOx
x
memristors to apply a spike-based computing paradigm, which is expected to deliver such a...
ver más
|
|
|
|
|
|