688 search results - page 58 / 138 » General Partitioning on Random Graphs |
105
click to vote
ENTCS
2008
15 years 2 months ago
2008
This paper describes a set of methods for randomly drawing traces in large models either uniformly among all traces, or with a coverage criterion as target. Classical random walk ...
109
click to vote
COLT
2008
Springer
15 years 4 months ago
2008
Springer
We analyze a sequential game between a Gambler and a Casino. The Gambler allocates bets from a limited budget over a fixed menu of gambling events that are offered at equal time i...
116
Voted
STOC
2009
ACM
16 years 3 months ago
2009
ACM
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
110
click to vote
SIGIR
2006
ACM
15 years 8 months ago
2006
ACM
We present a novel framework for answering complex questions that relies on question decomposition. Complex questions are decomposed by a procedure that operates on a Markov chain...
153
Voted
ACPC
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. A number of techniques are described for solving sparse linear systems on parallel platforms. The general approach used is a domaindecomposition type method in which a pr...