806 search results - page 35 / 162 » Lower Bounds on Correction Networks |
154
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
169
click to vote
UAI
2004
15 years 7 months ago
2004
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...
147
click to vote
AP2PC
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. The research in the paper is motivated by building a decentralized/P2P XML storage on top of a DHT (Distributed Hash Table). The storage must provide high data availabili...
154
click to vote
INFOCOM
2000
IEEE
15 years 10 months ago
2000
IEEE
— We study wavelength assignment for lightpaths over WDM rings to minimize the SONET ADMs used. This problem has attracted much attention recently. However, its computation compl...
158
click to vote
FORTE
2007
15 years 7 months ago
2007
Abstract. We present a formal specification and analysis of a faulttolerant DHCP algorithm, used to automatically configure certain host parameters in an IP network. Our algorith...