Results 41 to 50 of about 374 (101)
Optimized annealing of traveling salesman problem from the nth-nearest-neighbor distribution
, 2006 We report a new statistical general property in traveling salesman problem, that the $n$th-nearest-neighbor distribution of optimal tours verifies with very high accuracy an exponential decay as a function of the order of neighbor $n$.
Brooke +21 more
core +1 more source
Sustainable growth in complex networks
, 2010 Based on the empirical analysis of the dependency network in 18 Java projects, we develop a novel model of network growth which considers both: an attachment mechanism and the addition of new nodes with a heterogeneous distribution of their initial ...
C. J. Tessone +8 more
core +1 more source
From Large Scale Rearrangements to Mode Coupling Phenomenology
, 2005 We consider the equilibrium dynamics of Ising spin models with multi-spin interactions on sparse random graphs (Bethe lattices). Such models undergo a mean field glass transition upon increasing the graph connectivity or lowering the temperature ...
A. Montanari +5 more
core +3 more sources
Modulo Three Problem With A Cellular Automaton Solution
, 2002 An important global property of a bit string is the number of ones in it. It has been found that the parity (odd or even) of this number can be found by a sequence of deterministic, translational invariant cellular automata with parallel update in ...
Chau, H. F., Lee, K. M., Xu, Hao
core +1 more source
Boosting search by rare events
, 2001 Randomized search algorithms for hard combinatorial problems exhibit a large variability of performances. We study the different types of rare events which occur in such out-of-equilibrium stochastic processes and we show how they cooperate in ...
A. M. Frieze +16 more
core +1 more source
Testing the Collective Properties of Small-World Networks through Roughness Scaling
, 2003 Motivated by a fundamental synchronization problem in scalable parallel computing and by a recent criterion for ``mean-field'' synchronizability in interacting systems, we study the Edwards-Wilkinson model on two variations of a small-worldnetwork.
A. Barrat +10 more
core +1 more source
Exhaustive enumeration unveils clustering and freezing in random 3-SAT
, 2008 We study geometrical properties of the complete set of solutions of the random 3-satisfiability problem. We show that even for moderate system sizes the number of clusters corresponds surprisingly well with the theoretic asymptotic prediction.
A. Montanari +13 more
core +1 more source
Big Data of Materials Science - Critical Role of the Descriptor
, 2015 Statistical learning of materials properties or functions so far starts with a largely silent, non-challenged step: the choice of the set of descriptive parameters (termed descriptor).
Draxl, Claudia +4 more
core +1 more source
, 2007 Motivated by multi-objective optimization, we study extrema of a set of N points independently distributed inside the d-dimensional hypercube. A point in this set is k-dominated by another point when at least k of its coordinates are larger, and is a k ...
Ben-Naim E +18 more
core +1 more source
Reply To "Comment on 'Quantum String Seal Is Insecure' "
, 2007 In Phys. Rev. A. 76, 056301 (2007), He claimed that the proof in my earlier paper [Phys. Rev. A 75, 012327 (2007)] is insufficient to conclude the insecurity of all quantum string seals because my measurement strategy cannot obtain non-trivial ...
G. P. He +5 more
core +1 more source