245 search results - page 19 / 49 » Locating phase transitions in computationally hard problems |
INFOCOM
2003
IEEE
14 years 23 days ago
2003
IEEE
Abstract – In this paper, we develop failure-resilient techniques for monitoring link delays and faults in a Service Provider or Enterprise IP network. Our two-phased approach at...
FUIN
2008
13 years 7 months ago
2008
We study runtime distributions of subsumption testing. On graph data randomly sampled from two different generative models we observe a gradual growth of the tails of the distribut...
MOBIHOC
2006
ACM
14 years 7 months ago
2006
ACM
Recent studies on mobility modeling have focused on characterizing user mobility from real traces of wireless LANs (WLANs) and creating mobility models based on such characterizat...
GECCO
2004
Springer
14 years 26 days ago
2004
Springer
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Adiabatic quantum annealing is a paradigm of analog quantum computation, where a given computational job is converted to the task of finding the global minimum of some classical po...