Sciweavers

1520 search results - page 94 / 304
» The Ring Loading Problem
Sort
View
COCOON
2008
Springer
14 years 12 months ago
Multi-party Quantum Communication Complexity with Routed Messages
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,...
Seiichiro Tani, Masaki Nakanishi, Shigeru Yamashit...
TC
1998
14 years 9 months ago
Optimal Elections in Faulty Loop Networks and Applications
—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...
Bernard Mans, Nicola Santoro
FFA
2010
84views more  FFA 2010»
14 years 8 months ago
Additive functions for number systems in function fields
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...
Manfred G. Madritsch, Jörg M. Thuswaldner
AUTOMATICA
2011
14 years 5 months ago
Timing and liveness in continuous Petri nets
Fluidification constitutes a relaxation technique for studying discrete event systems through fluidified approximated models, thus avoiding the state explosion problem. Moreove...
Carlos Renato Vázquez, Manuel Silva
76
Voted
PAM
2010
Springer
15 years 5 months ago
Characterizing the Global Impact of P2P Overlays on the AS-Level Underlay
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...
Amir Hassan Rasti, Reza Rejaie, Walter Willinger