1963 search results - page 137 / 393 » The Maximum Solution Problem on Graphs |
112
Voted
SDM
2007
SIAM
15 years 3 months ago
2007
SIAM
When non-unique values are used as the identifier of entities, due to their homonym, confusion can occur. In particular, when (part of) “names” of entities are used as their ...
128
click to vote
OPODIS
2010
15 years 12 days ago
2010
We explore asynchronous unison in the presence of systemic transient and permanent Byzantine faults in shared memory. We observe that the problem is not solvable under less than s...
118
click to vote
ISAAC
2003
Springer
15 years 7 months ago
2003
Springer
We consider the problem of characterizing user equilibria and optimal solutions for selfish routing in a given network. We extend the known models by considering malicious behavio...
122
click to vote
CSDA
2006
15 years 2 months ago
2006
We propose a simulation-based method for calculating maximum likelihood estimators in latent variable models. The proposed method integrates a recently developed sampling strategy...
BIRTHDAY
2005
Springer
15 years 8 months ago
2005
Springer
In the double-pushout approach to graph transformations, most authors assume the left-hand side to be injective, since the noninjective case leads to ambiguous results. Taking into...