338 search results - page 39 / 68 » Effective Lower Bounding Techniques for Pseudo-Boolean Optim... |
GLOBECOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—This paper investigates the network performance loss of using only single-path routing when multiple paths are available. The performance metric is the aggregate utility achieve...
ICDE
2007
IEEE
14 years 2 months ago
2007
IEEE
Main memory is a critical resource when processing non-blocking queries with state intensive operators that require real-time responses. While partitioned parallel processing can ...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—We analyze how node mobility can influence the convergence time of averaging gossip algorithms on networks. Our main result is that even a small number of fully mobile nodes ca...
SODA
2001
ACM
13 years 9 months ago
2001
ACM
We consider a network providing Differentiated Services (DiffServ) which allow network service providers to offer different levels of Quality of Service (QoS) to different traffic...
JGAA
2006
13 years 7 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...