1542 search results - page 119 / 309 » The metamathematics of random graphs |
100
click to vote
ICC
2008
IEEE
15 years 8 months ago
2008
IEEE
—In battery-constrained large-scale sensor networks, nodes are prone to random failures due to various reasons, such as energy depletion and hostile environment. Random failures ...
108
Voted
ISAAC
2004
Springer
15 years 7 months ago
2004
Springer
Assuming 3-SAT formulas are hard to refute with high probability, Feige showed approximation hardness results, among others for the max bipartite clique. We extend this result in t...
124
Voted
FOCS
1994
IEEE
15 years 5 months ago
1994
IEEE
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
105
click to vote
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
We present discrete stochastic mathematical models for the growth curves of synchronous and asynchronous evolutionary algorithms with populations structured according to a random ...
124
click to vote
AOSD
2007
ACM
15 years 5 months ago
2007
ACM
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...