Results 211 to 220 of about 2,481,598 (245)
Some of the next articles are maybe not open access.
Quasi-randomized path planning
Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164), 2002We propose the use of quasi-random sampling techniques for path planning in high-dimensional configuration spaces. Following similar trends from related numerical computation fields, we show several advantages offered by these techniques in comparison to random sampling.
Michael S. Branicky +3 more
openaire +2 more sources
Quasi‐random classes of hypergraphs
Random Structures & Algorithms, 1990AbstractWe investigate the relations among a number of different graph properties for k‐uniformhypergraphs, which are shared by random hypergraphs. Various graph properties form equivalence classes which in turn constitute a natural hierarchy. The analogues for binary functions on k‐tuples and for hypergraphs with small density are also considered ...
openaire +3 more sources
Quasi-Random Multimetallic Nanoparticle Arrays
ACS Nano, 2023This paper describes a nanofabrication procedure that can generate multiscale substrates with quasi-random microregions of nanoparticle arrays having different periodicities and metals. We combine cycles of large-area nanoparticle array fabrication with solvent-assisted wrinkle lithography to mask and etch quasi-random areas of prefabricated ...
Francisco Freire-Fernández +7 more
openaire +2 more sources
Quasi-random sequences, which can evenly spread points across a hypercube, have been widely used in various areas. Recently, quasi-random testing technique, which makes use of quasi-random sequences to generate test cases, was proposed, and it normally ...
Huai Liu, Tsong Yueh Chen
exaly +3 more sources
Quasi-random points keep their distance
Mathematics and Computers in Simulation, 2007For a given net, composed of \(N\) quasi-random points \(Q_{0}, Q_{1}, \dots , Q_{N-1}\) in the \(n\)-dimensional hypercube \(I^{n}\), the measure \(d_{N} = \min_{0 \leq i < j < N} \rho(Q_{i}, Q_{j}), \) where \(\rho\) is the Euclidean distance between the points \(Q_{i}\) and \(Q_{j},\) called minimum distance, is considered. In section 2 the behavior
Ilya M. Sobol, Boris Shukhman
openaire +3 more sources
Self-Organization of Quasi-Random Copolymers
Doklady Physical Chemistry, 2002The theory of integral RISM-equations is applied to describe the equilibrium structure of a quasi random protein-like polymer. Interaction of collective correlation functions is given by the Ornstein-Zernike nonlinear integral equation.
Zherenkova, L. V. +3 more
openaire +2 more sources
Regularity lemmas for hypergraphs and quasi‐randomness
Random Structures & Algorithms, 1991AbstractWe give a simple proof for Szemerédi's Regularity Lemma and its generalization for k‐uniform hypergraphs. For fixed k, there are altogether k ‐1 different versions of the regularity lemma for k‐uniform hypergraphs. The connection between regularity lemmas for hypergraphs and quasi‐random classes of hypergraphs is also investigated.
openaire +3 more sources
Book Ramsey Numbers and Quasi-Randomness
Combinatorics, Probability and Computing, 2005A book \(B_p\) with \(p\) pages is a graph consisting of \(p\) triangles sharing a common edge. It was shown by \textit{C. C. Rousseau} and \textit{J. Sheehan} in [J. Graph Theory 2, 77--87 (1978; Zbl 0377.05033)] that the Ramsey number \(r(B_n, B_n) = (4 + o(1))n\).
Nikiforov, V. +2 more
openaire +2 more sources
Quasi-random nonlinear scale space
Pattern Recognition Letters, 2010A novel nonlinear scale space framework is proposed for the purpose of multi-scale image representation. The scale space decomposition problem is formulated as a general Bayesian least-squares estimation problem. A quasi-random density estimation approach is introduced for estimating the posterior distribution between consecutive scale space ...
Akshaya Kumar Mishra +3 more
openaire +1 more source
Quasi-random integration in high dimensions
Mathematics and Computers in Simulation, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
George Takhtamyshev +2 more
openaire +1 more source

