2343 search results - page 285 / 469 » The Locomotive Routing Problem |
159
click to vote
MASCOTS
2008
15 years 7 months ago
2008
Two classic categories of models exist for computer networks: network information flow and network of queues. The network information flow model appropriately captures the multi-ho...
164
click to vote
DATE
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—To deal with the “memory wall” problem, microprocessors include large secondary on-chip caches. But as these caches enlarge, they originate a new latency gap between...
178
click to vote
IPSN
2010
Springer
16 years 23 days ago
2010
Springer
For in-network storage schemes, one maps data, indexed in a logical space, to the distributed sensor locations. When the physical sensor network has an irregular shape and possibl...
170
click to vote
INFOCOM
1999
IEEE
15 years 10 months ago
1999
IEEE
We investigate the problem of optimal resource allocation for end-to-end QoS requirements on unicast paths and multicast trees. Specifically, we consider a framework in which reso...
186
click to vote
FSTTCS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We study the synthesis problem for external linear or branching specifications and distributed, synchronous architectures with arbitrary delays on processes. External mea...