1542 search results - page 186 / 309 » The metamathematics of random graphs |
AAAI
1994
15 years 3 months ago
1994
We present the results of an empirical study of several constraint satisfaction search algorithms and heuristics. Using a random problem generator that allows us to create instanc...
JSAT
2006
15 years 1 months ago
2006
It is well known that satisfiability of random sets of propositional clauses undergoes phase transition while the clause-to-variable ratio of the sets increases. We introduce anot...
INFOCOM
2006
IEEE
15 years 7 months ago
2006
IEEE
— In this paper, we seek to understand the intrinsic reasons for the well-known phenomenon of heavy-tailed degree in the Internet AS graph and argue that in contrast to tradition...
SIGMETRICS
2005
ACM
15 years 7 months ago
2005
ACM
—To model P2P networks that are commonly faced with high rates of churn and random departure decisions by end-users, this paper investigates the resilience of random graphs to li...
120
click to vote
ATAL
2008
Springer
15 years 3 months ago
2008
Springer
Reinforcement Learning research is traditionally devoted to solve single-task problems. Therefore, anytime a new task is faced, learning must be restarted from scratch. Recently, ...