1963 search results - page 191 / 393 » The Maximum Solution Problem on Graphs |
ICRA
2000
IEEE
15 years 7 months ago
2000
IEEE
In this paper we deal with the problem of allocating a given number of tokens, so as to maximize the firing rate of a cyclic event graph with deterministic transition firing delay...
126
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
123
Voted
NETWORKS
2008
15 years 3 months ago
2008
Minimizing the number of add-drop multiplexers (ADMs) in a unidirectional SONET ring can be formulated as a graph decomposition problem. When traffic requirements are uniform and ...
124
click to vote
EUROPAR
2004
Springer
15 years 8 months ago
2004
Springer
Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM a...
132
click to vote
ICC
2007
IEEE
15 years 9 months ago
2007
IEEE
—This paper provides a new iterative solution to the problem of the joint estimation of phase noise and residual carrier frequency offset in an orthogonal frequency division mult...