1520 search results - page 94 / 304 » The Ring Loading Problem |
117
click to vote
COCOON
2008
Springer
15 years 4 months ago
2008
Springer
This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths,...
107
click to vote
TC
1998
15 years 2 months ago
1998
—Loop networks (or Hamiltonian circulant graphs) are a popular class of fault-tolerant network topologies which include rings and complete graphs. For this class, the fundamental...
FFA
2010
15 years 29 days ago
2010
Let Fq be a finite field with q elements and p ∈ Fq[X, Y ]. In this paper we study properties of additive functions with respect to number systems which are defined in the rin...
229
click to vote
AUTOMATICA
2011
14 years 9 months ago
2011
Fluidification constitutes a relaxation technique for studying discrete event systems through fluidified approximated models, thus avoiding the state explosion problem. Moreove...
114
click to vote
PAM
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. This paper examines the problem of characterizing and assessing the global impact of the load imposed by a Peer-to-Peer (P2P) overlay on the AS-level underlay. In particu...