325 search results - page 33 / 65 » Hamilton cycles in random graphs and directed graphs |
184
click to vote
SIAMDM
2010
15 years 25 days ago
2010
The following problem was introduced by Marcin Krzywkowski as a generalization of a problem of Todd Ebert. After initially coordinating a strategy, n players each occupy a differe...
186
click to vote
DBSEC
2008
15 years 7 months ago
2008
To protect critical resources in today’s networked environments, it is desirable to quantify the likelihood of potential multi-step attacks that combine multiple vulnerabilities....
188
click to vote
SARA
2009
Springer
16 years 19 days ago
2009
Springer
We study novel approaches for solving of hard combinatorial problems by translation to Boolean Satisfiability (SAT). Our focus is on combinatorial problems that can be represented...
192
click to vote
KDD
2007
ACM
16 years 6 months ago
2007
ACM
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
157
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
In the unconditionally reliable message transmission (URMT) problem, two non-faulty players, the sender S and the receiver R are part of a synchronous network modeled as a directe...