Results 11 to 20 of about 277,393 (334)
IEEE Access, 2021 Model Predictive Control is a promising technique for electric drive control, as it enables optimization for multiple parameters and offers reliable operation with non-linear systems.
Kristof Bandy, Peter Stumpf
doaj +1 more source
Exploring Artificial Intelligence Architecture in Data Cleaning Based on Bayesian Networks
Advances in Multimedia, 2022 In order to further improve the technical level of data cleaning and data mining and better avoid the defects of uncertain knowledge expression in traditional Bayesian networks, a Bayesian network algorithm based on combined data cleaning and mining ...
Suzhen Zhang, Yuechun Wang, Qing Lv
doaj +1 more source
Electronic Notes in Theoretical Computer Science, 2009 AbstractA high-level overview of the MOQA language is presented. The representation of its data structure, a labeled series-parallel partial order, is shown along with some of the functions allowed upon this data structure. The combination of MOQA's data structure and its functions capture the required calculus to statically obtain the average-case ...
Joseph Manning +2 more
openaire +2 more sources
Average-case analysis of perfect sorting by reversals (Journal Version) [PDF]
, 2011 Perfect sorting by reversals, a problem originating in computational genomics, is the process of sorting a signed permutation to either the identity or to the reversed identity permutation, by a sequence of reversals that do not break any common interval.
Bouvel, Mathilde +3 more
core +3 more sources
A Fast Suffix-Sorting Algorithm [PDF]
Electronic Notes in Discrete Mathematics, 2005 We present an algorithm to sort all suffixes of $x^n=(x_1,\dots,x_n) \in {\cal X}^n$ lexicographically, where ${\cal X}=\{0,\dots,q-1\}$. Fast and efficient sorting of a large amount of data according to its suffix structure (suffix-sorting) is a useful technology in many fields of application, front-most in the field of Data Compression where it is ...
Ahlswede, Rudolf +10 more
openaire +1 more source
An Agglomeration Law for Sorting Networks and its Application in Functional Programming [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 In this paper we will present a general agglomeration law for sorting networks. Agglomeration is a common technique when designing parallel programmes to control the granularity of the computation thereby finding a better fit between the algorithm and ...
Lukas Immanuel Schiller
doaj +1 more source
Exploring Auto-Generation of Network Models With Performance Evaluation Process Algebra
IEEE Access, 2018 Formal method plays an important role in modeling large scale concurrent networks through its efficient model construction and analysis. Taking urban road networks and public transportation systems as examples, such models can be defined in a formal ...
Jie Ding +3 more
doaj +1 more source
Path planning of coal gangue sorting robot based on G-RRT* algorithm
Gong-kuang zidonghua, 2022 The coal gangue sorting environment is complex. In order to avoid the collision between robot and obstacles and improve sorting efficiency, it is necessary to carry out path planning for robot. The principle of coal gangue sorting system is analyzed. The
ZHU Ziqi, LI Chuangye, DAI Wei
doaj +1 more source
Noisy sort, a memory-intensive sorting algorithm
Linear Algebra and its Applications, 1989 A table-lookup technique for sorting is developed. It is a highly parallel method which develops an approximation to the sort through a single access to an associative memory. A postprocessing step is intended to complete the sort. The scheme is most effective for special for special data classes.
Susumu Horiguchi, Williard L. Miranker
openaire +3 more sources
An empirical study of the gap sequences for Shell sort
Lietuvos Matematikos Rinkinys, 2013 We present an improved version of the Shell sort algorithm. Using the algorithm, we study various geometrical sequences and the performance of Shell sort.
Irmantas Radavičius +1 more
doaj +1 more source