2694 search results - page 406 / 539 » Fully Distributed Algorithms for Convex Optimization Problem... |
145
click to vote
WG
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we study the sub-coloring and hypo-coloring problems on interval graphs. These problems have applications in job scheduling and distributed computing and can be used...
182
click to vote
INFOCOM
2012
IEEE
13 years 8 months ago
2012
IEEE
Abstract—BitTorrent has been the most popular P2P (Peer-toPeer) paradigm during recent years. Built upon great intuition, the piece-selection and neighbor-selection modules roote...
214
click to vote
GPCE
2009
Springer
15 years 9 months ago
2009
Springer
Mapping problem-space features into solution-space features is a fundamental configuration problem in software product line engineering. A configuration problem is defined as g...
177
click to vote
ICPP
2005
IEEE
16 years 16 hour ago
2005
IEEE
In this paper we introduce a new algorithm for computing near optimal schedules for task graph problems. In contrast to conventional approaches for solving those scheduling proble...
162
click to vote
EOR
2007
15 years 6 months ago
2007
We consider a supply chain design problem where the decision maker needs to decide the number and locations of the distribution centers (DCs). Customers face random demand, and ea...