Sciweavers

501 search results - page 85 / 101
» Communication Lower Bounds Using Dual Polynomials
Sort
View
CONEXT
2005
ACM
13 years 10 months ago
MRS: a simple cross-layer heuristic to improve throughput capacity in wireless mesh networks
Wireless Mesh Networks (WMNs) are an emerging architecture based on multi-hop transmission. ISPs considers WMNs as a potential future technology to offer broadband Internet acces...
Luigi Iannone, Serge Fdida
JCB
2006
115views more  JCB 2006»
13 years 8 months ago
Designing an A* Algorithm for Calculating Edit Distance between Rooted-Unordered Trees
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...
Yair Horesh, Ramit Mehr, Ron Unger
SIGECOM
2010
ACM
164views ECommerce» more  SIGECOM 2010»
14 years 1 months ago
Truthful mechanisms with implicit payment computation
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
Moshe Babaioff, Robert D. Kleinberg, Aleksandrs Sl...
GLOBECOM
2006
IEEE
14 years 2 months ago
Further Analysis of XCP Equilibrium Performance
— Low analyzes the equilibrium performance of the recently developed eXplicit Control Protocol (XCP) by applying the derived window-based dynamical model. However, Low’s window...
Peng Wang, David L. Mills
SIROCCO
2000
13 years 10 months ago
Cooperative computing with fragmentable and mergeable groups
ABSTRACT: This work considers the problem of performing a set of N tasks on a set of P cooperating message-passing processors (P N). The processors use a group communication servi...
Chryssis Georgiou, Alexander A. Shvartsman