16596 search results - page 144 / 3320 » Generalized Assignment Problems |
IPPS
2003
IEEE
15 years 3 months ago
2003
IEEE
Given a set of service requests, each char acterize d by a temporal interval and a category, an integer k, and an integer hc for each categoryc, the Server A llocation with Bounde...
DAC
2005
ACM
14 years 12 months ago
2005
ACM
We present BonnPlace, a new VLSI placement algorithm that combines the advantages of analytical and partitioning-based placers. Based on (non-disjoint) placements minimizing the t...
GECCO
2008
Springer
14 years 11 months ago
2008
Springer
This paper presents a communication-less multi-agent task allocation procedure that allows agents to use past experience to make non-greedy decisions about task assignments. Exper...
GC
2007
Springer
14 years 10 months ago
2007
Springer
The pre-coloring extension problem consists, given a graph G and a set of nodes to which some colors are already assigned, in finding a coloring of G with the minimum number of co...
BMCBI
2005
14 years 10 months ago
2005
Background: Accurate assignment of genes to pathways is essential in order to understand the functional role of genes and to map the existing pathways in a given genome. Existing ...