3172 search results - page 52 / 635 » On the Random-Self-Reducibility of Complete Sets |
121
Voted
CCGRID
2006
IEEE
15 years 6 months ago
2006
IEEE
— Desktop grids use the idle cycles of desktop PC’s to provide huge computational power at low cost. However, because the underlying desktop computing resources are volatile, a...
89
Voted
DAGSTUHL
2007
15 years 2 months ago
2007
: Ranking theory delivers an account of iterated contraction; each ranking function induces a specific iterated contraction behavior. The paper gives a complete axiomatization of t...
104
Voted
SIAMDM
2008
15 years 19 days ago
2008
Let Kn,n denote the complete bipartite graph with n vertices in each partite set and Kn,n +I denote Kn,n with a 1-factor added. It is proved in this paper that there exists an m-c...
118
click to vote
AMAST
2008
Springer
15 years 2 months ago
2008
Springer
Term Rewriting Systems (TRSs) are now commonly used as a modeling language for applications. In those rewriting based models, reachability analysis, i.e. proving or disproving that...
96
Voted
DM
2008
15 years 23 days ago
2008
Let F be a 2-factorization of the complete graph Kv admitting an automorphism group G acting primitively on the set of vertices. If F consists of Hamiltonian cycles, then F is the...