1941 search results - page 186 / 389 » On Generalizations of Network Design Problems with Degree Bo... |
235
Voted
ADHOCNOW
2004
Springer
16 years 15 days ago
2004
Springer
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
188
click to vote
STACS
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...
168
Voted
INFOCOM
2003
IEEE
16 years 11 days ago
2003
IEEE
— A method commonly used for packet flow control over connections with long round-trip delays is “sliding windows”. In general, for a given loss rate, a larger window size a...
217
click to vote
ICPADS
2002
IEEE
16 years 1 days ago
2002
IEEE
Network emulation systems are widely used to explore the behavior of network protocols and to test and evaluate protocol implementations and applications. The major problem of net...
170
Voted
ICLP
2003
Springer
16 years 9 days ago
2003
Springer
We propose and study algorithms for computing minimal models, stable models and answer sets of 2- and 3-CNF theories, and normal and disjunctive 2- and 3-programs. We are especiall...