3433 search results - page 288 / 687 » Heuristics for a bidding problem |
165
click to vote
MST
2010
15 years 5 months ago
2010
We study the following variant of the bin covering problem. We are given a set of unit sized items, where each item has a color associated with it. We are given an integer paramet...
149
click to vote
SCHEDULING
2010
15 years 1 months ago
2010
We consider large volume job shop scheduling problems, in which there is a fixed number of machines, a bounded number of activities per job, and a large number of jobs. In large v...
160
click to vote
DATE
2009
IEEE
16 years 1 months ago
2009
IEEE
—In this paper, we propose a multi-task mapping/scheduling technique for heterogeneous and scalable MPSoC. To utilize the large number of cores embedded in MPSoC, the proposed te...
167
click to vote
NAS
2009
IEEE
16 years 1 months ago
2009
IEEE
- In this work, we study the problem of maximizing lightpath reliability in optical mesh networks against simultaneous failures of multiple fiber links without using protection sch...
168
click to vote
WEA
2007
Springer
16 years 26 days ago
2007
Springer
We present a systematic study of approximation algorithms for the maximum weight matching problem. This includes a new algorithm which provides the simple greedy method with a rece...