3211 search results - page 182 / 643 » On the Grundy Number of a Graph |
153
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
In this paper we relate the problem of finding structures related to perfect matchings in bipartite graphs to a stochastic process similar to throwing balls into bins. Given a bip...
134
click to vote
ICC
2007
IEEE
16 years 24 days ago
2007
IEEE
Abstract— We propose belief propagation (BP) based detection algorithms for the Bell labs layered space-time (BLAST) architectures. We first develop a full complexity BP algorit...
152
click to vote
FLAIRS
2006
15 years 7 months ago
2006
We propose to improve the efficiency of genetic programming, a method to automatically evolve computer programs. We use graph-based data mining to identify common aspects of highl...
174
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In MaxSat, we ask for an assignment which satisfies the maximum number of clauses for a boolean formula in CNF. We present an algorithm yielding a run time upper bound of O (2 K 6....
134
click to vote
ENDM
2006
15 years 6 months ago
2006
Jim Propp's rotor router model is a simple deterministic analogue of a random walk. Instead of distributing chips randomly, it serves the neighbors in a fixed order. We analy...