Results 241 to 250 of about 90,608 (299)
Some of the next articles are maybe not open access.
IEEE Transactions on Reliability, 2005
Our paper proposes an implementable procedure for using the method of quasi-random sequences in software debug testing. In random testing, the sequence of tests (if considered as points in an n-dimensional unit hypercube) will give rise to regions where there are clusters of points, as well as underpopulated regions.
Tsong Yueh Chen, Robert G. Merkel
openaire +2 more sources
Our paper proposes an implementable procedure for using the method of quasi-random sequences in software debug testing. In random testing, the sequence of tests (if considered as points in an n-dimensional unit hypercube) will give rise to regions where there are clusters of points, as well as underpopulated regions.
Tsong Yueh Chen, Robert G. Merkel
openaire +2 more sources
Journal of Graph Theory, 1991
AbstractWe introduce a large class of tournament properties, all of which are shared by almost all random tournaments. These properties, which we term “quasi‐random,” have the property that tournaments possessing any one of the properties must of necessity possess them all.
Fan R. K. Chung, Ronald L. Graham
openaire +2 more sources
AbstractWe introduce a large class of tournament properties, all of which are shared by almost all random tournaments. These properties, which we term “quasi‐random,” have the property that tournaments possessing any one of the properties must of necessity possess them all.
Fan R. K. Chung, Ronald L. Graham
openaire +2 more sources
Communication Complexity and Quasi Randomness
SIAM Journal on Discrete Mathematics, 1993Summary: The multiparty communication complexity concerns the least number of bits that must be exchanged among a number of players to collaboratively compute a Boolean function \(f(x_ 1,\dots,x_ k)\), while each player knows at most \(t\) inputs for some fixed ...
Fan R. K. Chung, Prasad Tetali
openaire +1 more source
Combinatorica, 2002
Let \(G_{1/2}(n)\) denote a random graph with \(n\) vertices in which each pair is selected to be an edge independently with probability \(1/2\). Almost all of them satisfy several basic properties which turn out to be equivalent. Families of graphs satisfying this equivalence class of properties are called quasi-random, see e.g. \textit{F. R. K. Chung}
Fan R. K. Chung, Ronald L. Graham
openaire +2 more sources
Let \(G_{1/2}(n)\) denote a random graph with \(n\) vertices in which each pair is selected to be an edge independently with probability \(1/2\). Almost all of them satisfy several basic properties which turn out to be equivalent. Families of graphs satisfying this equivalence class of properties are called quasi-random, see e.g. \textit{F. R. K. Chung}
Fan R. K. Chung, Ronald L. Graham
openaire +2 more sources
Collective lattice resonances in disordered and quasi-random all-dielectric metasurfaces
Journal of the Optical Society of America B, 2019Collective lattice resonances in disordered 2D arrays of spherical Si nanoparticles (NPs) have been thoroughly studied within the framework of the coupled dipole approximation. Three types of defects have been analyzed: positional disorder, size disorder,
V. Zakomirnyi +3 more
semanticscholar +1 more source
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 +1 more source
A biased random-key genetic algorithm for the maximum quasi-clique problem
European Journal of Operational Research, 2018Given a graph G = ( V , E ) and a threshold γ ∈ (0, 1], the maximum cardinality quasi-clique problem consists in finding a maximum cardinality subset C* of the vertices in V such that the density of the graph induced in G by C* is greater than or equal ...
Celso C Ribeiro +2 more
exaly +2 more sources
Randomized quasi-random sampling/importance resampling
Communications in statistics. Simulation and computation, 2018Sampling/importance resampling method is widely used in Bayesian statistics. Literatures have carried out a variety of improvements to promote the computational expanse and the accuracy.
J. Ning, Huiqiang Tao
semanticscholar +1 more source
Broadband Mie driven random quasi-phase-matching
Nature Photonics, 2020High-quality crystals without inversion symmetry are the conventional platform to achieve optical frequency conversion via three-wave mixing. In bulk crystals, efficient wave mixing relies on phase-matching configurations, while at the micro- and ...
R. Savo +8 more
semanticscholar +1 more source
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 +2 more sources