Results 91 to 100 of about 47,244 (120)
Some of the next articles are maybe not open access.
An improved localisation algorithm for performance improvement
International Journal of Mobile Communications, 2012Aiming at solving the localisation problems in wireless sensor networks with weak adaptability, high dependence on the network environment and imperfect position accuracy, an improved Distance Vector-Hop (DV-Hop) algorithm is presented in this paper.
Wei Hu, Fu-Yuan Xu
openaire +1 more source
2016 XIth International Scientific and Technical Conference Computer Sciences and Information Technologies (CSIT), 2016
This paper presents an improved particle swarm optimization algorithm (CPSO) in which corrective procedure was introduced. The aim of this corrective procedure is to set new, better velocities for some particles when their present velocities are inefficient. New velocities are the functions of previous and current velocities.
openaire +1 more source
This paper presents an improved particle swarm optimization algorithm (CPSO) in which corrective procedure was introduced. The aim of this corrective procedure is to set new, better velocities for some particles when their present velocities are inefficient. New velocities are the functions of previous and current velocities.
openaire +1 more source
An Improvement of the Elliptic Net Algorithm
IEEE Transactions on Computers, 2016In this paper we propose a modified Elliptic Net algorithm to compute pairings. By reducing the number of the intermediate variables which should be updated in the iteration loop of the Elliptic Net algorithm, we speed up the computation of pairings.
Binglong Chen, Chang-An Zhao
openaire +2 more sources
2016
Classical multidimensional scaling (CMDS) is a widely used method for dimensionality reduction and data visualization, but it’s very slow. Landmark MDS (LMDS) is a fast algorithm of CMDS. In LMDS, some data points are designated as landmark points. When the intrinsic dimension of the landmark points is less than the intrinsic dimension of the data set,
Taiguo Qu, Zixing Cai
openaire +1 more source
Classical multidimensional scaling (CMDS) is a widely used method for dimensionality reduction and data visualization, but it’s very slow. Landmark MDS (LMDS) is a fast algorithm of CMDS. In LMDS, some data points are designated as landmark points. When the intrinsic dimension of the landmark points is less than the intrinsic dimension of the data set,
Taiguo Qu, Zixing Cai
openaire +1 more source
Improved Kolchin–Ritt Algorithm
Programming and Computer Software, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Giuseppa Carrà Ferro, Vladimir P. Gerdt
openaire +1 more source
An improvement to the bit stuffing algorithm
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings., 2004The bit stuffing algorithm is a technique for coding constrained sequences by the insertion of bits into an arbitrary data sequence. This approach was previously introduced and applied to (d, k) constrained codes. Results show that the maximum average rate of the bit stuffing code achieves capacity when k=d+1 or k=/spl infin/, while it is suboptimal ...
Sharon Aviran +2 more
openaire +1 more source
Delineating the conformational landscape of the adenosine A2A receptor during G protein coupling
Cell, 2021Shuya Kate Huang +2 more
exaly
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06, 2006
Nir Ailon +3 more
openaire +2 more sources
Nir Ailon +3 more
openaire +2 more sources
An Improved Sign Determination Algorithm
1991Recently there has been a lot of activity in algorithms that work over real closed fields, and that perform such calculations as quantifier elimination or computing connected components of semi-algebraic sets. A cornerstone of this work is a symbolic sign determination algorithm due to Ben-Or, Kozen and Reif [BOKR86].
openaire +1 more source