2694 search results - page 123 / 539 » Fully Distributed Algorithms for Convex Optimization Problem... |
240
Voted
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We study the problem of maximizing the broadcast rate in peer-to-peer (P2P) systems under node degree bounds, i.e., the number of neighbors a node can simultaneously connect to is ...
137
click to vote
JAIR
2007
15 years 4 months ago
2007
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
132
click to vote
ICCAD
2006
IEEE
16 years 1 months ago
2006
IEEE
With the advent of deep sub-micron (DSM) era, floorplanning has become increasingly important in physical design process. In this paper we clarify a misunderstanding in using Lag...
166
click to vote
NETWORKS
2008
15 years 4 months ago
2008
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
158
click to vote
JGAA
2000
15 years 4 months ago
2000
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...