Results 31 to 40 of about 374 (101)
Typical solution time for a vertex-covering algorithm on finite-connectivity random graphs
, 2000 In this letter, we analytically describe the typical solution time needed by a backtracking algorithm to solve the vertex-cover problem on finite-connectivity random graphs.
Hartmann, Alexander K., Weigt, Martin
core +1 more source
Noise Limited Computational Speed
, 2007 In modern transistor based logic gates, the impact of noise on computation has become increasingly relevant since the voltage scaling strategy, aimed at decreasing the dissipated power, has increased the probability of error due to the reduced switching ...
Buckingham M. J., L. Gammaitoni, Sano N.
core +1 more source
Scale-Free Networks Emerging from Weighted Random Graphs
, 2005 We study Erd\"{o}s-R\'enyi random graphs with random weights associated with each link. We generate a new ``Supernode network'' by merging all nodes connected by links having weights below the percolation threshold (percolation clusters) into a single ...
A. S. Ioselevich +12 more
core +1 more source
A Yule-Simon process with memory
, 2006 The Yule-Simon model has been used as a tool to describe the growth of diverse systems, acquiring a paradigmatic character in many fields of research.
C Cattuto +10 more
core +1 more source
Energy Requirement of Control: Comments on Szilard's Engine and Maxwell's Demon [PDF]
, 2012 In mathematical physical analyses of Szilard's engine and Maxwell's demon, a general assumption (explicit or implicit) is that one can neglect the energy needed for relocating the piston in Szilard's engine and for driving the trap door in Maxwell's ...
Brillouin L. +7 more
core +3 more sources
Finding instabilities in the community structure of complex networks
, 2005 The problem of finding clusters in complex networks has been extensively studied by mathematicians, computer scientists and, more recently, by physicists. Many of the existing algorithms partition a network into clear clusters, without overlap.
A. Capocci +7 more
core +1 more source
Thermal Logic Gates: Computation with phonons
, 2007 Logic gates are basic digital elements for computers. We build up thermal logic gates that can perform similar operations as their electronic counterparts.
Baowen Li +4 more
core +1 more source
Extremal properties of random trees
, 2001 We investigate extremal statistical properties such as the maximal and the minimal heights of randomly generated binary trees. By analyzing the master evolution equations we show that the cumulative distribution of extremal heights approaches a traveling
Ben-Naim, E. +2 more
core +1 more source
Diffusive capture processes for information search [PDF]
, 2007 We show how effectively the diffusive capture processes (DCP) on complex networks can be applied to information search in the networks. Numerical simulations show that our method generates only 2% of traffic compared with the most popular flooding-based ...
Adamic +36 more
core +2 more sources
Hiding solutions in random satisfiability problems: A statistical mechanics approach
, 2002 A major problem in evaluating stochastic local search algorithms for NP-complete problems is the need for a systematic generation of hard test instances having previously known properties of the optimal solutions.
A. Horie +22 more
core +1 more source