Zobrazeno 1 - 7
of 7
pro vyhledávání: '"02"'
Autor:
Jeff Edmonds
Publikováno v:
Theoretical Computer Science. :12-22
This paper studies the performance of AIMD (Additive Increase Multiplicative Decrease) TCP as an online distributed scheduling algorithm for allocating transmission rate to sessions/jobs running on a general network. The network consists of a set of
Publikováno v:
Theoretical Computer Science. (1-3):215-236
We continue the study of multicast cost sharing from the viewpoints of both computational complexity and economic mechanism design. We provide fundamental lower bounds on the network complexity of group-strategyproof, budget-balanced mechanisms. We a
Publikováno v:
Theoretical Computer Science. (1):25-36
Peer-to-peer overlay networks present new opportunities and challenges for achieving enhanced network functionality at the application level. In this paper we study the impact of point-to-point network latency on flooding broadcast operations in peer
Publikováno v:
Formal Foundations of Embedded Software and Component-Based Software Architectures (FESCA), Satellite workshop of ETAPS
Formal Foundations of Embedded Software and Component-Based Software Architectures (FESCA), Satellite workshop of ETAPS, Mar 2007, Braga, Portugal. 13 p
Formal Foundations of Embedded Software and Component-Based Software Architectures (FESCA), Satellite workshop of ETAPS, Mar 2007, Braga, Portugal. 13 p
International audience; In component-based software development approaches, components are considered as black boxes, communicating through required and provided interfaces which describe their visible behaviors. Each component interface is equipped
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2010, 411 (14--15), pp.1638--1647. ⟨10.1016/j.tcs.2010.01.011⟩
Structural Information and Communication Complexity ISBN: 9783540693260
SIROCCO
Lecture Notes in Computer Science
Proceedings of the 15th Colloquium on Structural Information and Communication Complexity (SIROCCO 2008)
Proceedings of the 15th Colloquium on Structural Information and Communication Complexity (SIROCCO 2008), 2008, Switzerland. pp.20--32, ⟨10.1007/978-3-540-69355-0_4⟩
Theoretical Computer Science, 2010, 411 (14--15), pp.1638--1647. ⟨10.1016/j.tcs.2010.01.011⟩
Theoretical Computer Science, Elsevier, 2010, 411 (14--15), pp.1638--1647. ⟨10.1016/j.tcs.2010.01.011⟩
Structural Information and Communication Complexity ISBN: 9783540693260
SIROCCO
Lecture Notes in Computer Science
Proceedings of the 15th Colloquium on Structural Information and Communication Complexity (SIROCCO 2008)
Proceedings of the 15th Colloquium on Structural Information and Communication Complexity (SIROCCO 2008), 2008, Switzerland. pp.20--32, ⟨10.1007/978-3-540-69355-0_4⟩
Theoretical Computer Science, 2010, 411 (14--15), pp.1638--1647. ⟨10.1016/j.tcs.2010.01.011⟩
We consider a fixed, undirected, known network and a number of “mobile agents” which can traverse the network in synchronised steps. Some nodes in the network may be faulty and the agents are to find the faults and repair them. The agents could b
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, 2006, Algebraic Methodology and Software Technology, 351 (2), pp.167--183. ⟨10.1016/j.tcs.2005.09.066⟩
Theoretical Computer Science, Elsevier, 2006, Algebraic Methodology and Software Technology, 351 (2), pp.167--183. ⟨10.1016/j.tcs.2005.09.066⟩
Theoretical Computer Science, 2006, Algebraic Methodology and Software Technology, 351 (2), pp.167--183. ⟨10.1016/j.tcs.2005.09.066⟩
Theoretical Computer Science, Elsevier, 2006, Algebraic Methodology and Software Technology, 351 (2), pp.167--183. ⟨10.1016/j.tcs.2005.09.066⟩
Distributed groupware systems provide computer support for manipulating objects such as a text document or a filesystem, shared by two or more geographically separated users. Data replication is a technology to improve performance and availability of
Publikováno v:
Theoretical Computer Science. (1-3):412-447
From an engineering point of view, the problem of coordinating a set of autonomous, mobile robots for the purpose of cooperatively performing a task has been studied extensively over the past decade. In contrast, in this paper we aim to understand th