3616 search results - page 250 / 724 » Conditional Memory Ordering |
124
click to vote
JDA
2007
15 years 5 months ago
2007
Path coupling is a useful technique for simplifying the analysis of a coupling of a Markov chain. Rather than defining and analysing the coupling on every pair in Ω×Ω, where...
112
Voted
ADCM
2004
15 years 5 months ago
2004
Abstract. We study conditions on the matrix mask of a vector subdivision scheme ensuring that certain polynomial input vectors yield polynomial output again. The conditions are in ...
138
Voted
COMBINATORICS
2002
15 years 4 months ago
2002
Let In() denote the number of involutions in the symmetric group Sn which avoid the permutation . We say that two permutations , Sj may be exchanged if for every n, k, and order...
185
Voted
JGO
2010
15 years 3 months ago
2010
In this paper, the global optimization problem with an objective function that is multiextremal that satisfies the Lipschitz condition over a hypercube is considered. An algorithm...
125
Voted
JGT
2010
15 years 3 months ago
2010
Sufficient degree conditions for the existence of properly edge-colored cycles and paths in edge-colored graphs, multigraphs and random graphs are inverstigated. In particular, we...