2446 search results - page 229 / 490 » Choiceless Polynomial Time |
215
click to vote
INFOCOM
2006
IEEE
16 years 1 months ago
2006
IEEE
— Wireless mesh network is designed as an economical solution for last-mile broadband Internet access. In this paper, we study bandwidth allocation in multi-channel multihop wire...
124
click to vote
IPPS
2006
IEEE
16 years 1 months ago
2006
IEEE
We study a version of the β-assignment problem [3] on asynchronous rings: consider a set of items and a set of m colors, where each item is associated to one color. Consider also...
162
click to vote
ASM
2005
ASM
16 years 22 days ago
2005
ASM
lation of BGS model of Abstract State Machines Comandur Seshadhri1 , Anil Seth2 , and Somenath Biswas2 1 Department of Computer Science Princeton University, Princeton NJ 08544, US...
211
click to vote
ESA
2005
Springer
16 years 21 days ago
2005
Springer
Abstract. We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are re...
200
click to vote
ESA
2005
Springer
16 years 21 days ago
2005
Springer
We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of node...