4037 search results - page 44 / 808 » Routing without ordering |
ECOOP
2006
Springer
13 years 11 months ago
2006
Springer
Adaptive Programming (AP) allows for the separate definition of data structures and traversals with attached computations, performed during the traversal, that operate on these dat...
ATAL
2007
Springer
13 years 11 months ago
2007
Springer
Merging operators try to define the beliefs of a group of agents according to the beliefs of each member of the group. Several model-based propositional belief merging operators h...
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
— Optimal bandwidth utilisation together with resilience and recovery from failure are two key drivers for Traffic Engineering (TE) which have been widely addressed by the IP co...
ISCA
2009
IEEE
14 years 2 months ago
2009
IEEE
Buffers in on-chip networks consume significant energy, occupy chip area, and increase design complexity. In this paper, we make a case for a new approach to designing on-chip in...
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
— We consider the problem of routing messages through a network with episodic connectivity without a priori knowledge of node schedules or locations. We present Steward Assisted ...