4865 search results - page 251 / 973 » The Complexity of Graph Connectivity |
150
Voted
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
152
click to vote
COMPLEX
2009
Springer
16 years 22 days ago
2009
Springer
Abstract. We study the nonequilibrium phenomena of a coupled active rotator model in complex networks. From a numerical Langevin simulation, we find the peculiar phase transition ...
167
click to vote
ICECCS
2005
IEEE
15 years 11 months ago
2005
IEEE
Middleware enables distributed components to interact with each others in diverse and complex manners. Such interactions should be modeled at architecture level for controlling th...
207
click to vote
PODC
2011
ACM
14 years 9 months ago
2011
ACM
This work studies decision problems from the perspective of nondeterministic distributed algorithms. For a yes-instance there must exist a proof that can be verified with a distri...
157
Voted
CSCLP
2005
Springer
15 years 11 months ago
2005
Springer
CSP search algorithms are exponential in the worst-case. A trivial upper bound on the time complexity of CSP search algorithms is O∗ (dn ), where n and d are the number of variab...