914 search results - page 64 / 183 » Branch and Bound on the Network Model |
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
A coevolutionary competitive learning environment for two antagonistic agents is presented. The agents are controlled by a new kind of computational network based on a compartment...
100
click to vote
TDSC
2010
14 years 4 months ago
2010
Network survivability is the ability of a network keeping connected under failures and attacks, which is a fundamental issue to the design and performance evaluation of wireless ad...
COLOGNETWENTE
2007
14 years 11 months ago
2007
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded gr...
ICC
2008
IEEE
15 years 4 months ago
2008
IEEE
—In this paper the performance of unslotted ALOHA and CSMA are analyzed in spatially distributed wireless networks. Users/packets arrive randomly in space and time according to a...
INFOCOM
1993
IEEE
15 years 1 months ago
1993
IEEE
This paper addresses the problem of finding the worst case end-to-end delay and buffer occupancy bounds in ATM networks with rate-controlled, non-work conserving servers. A theore...