836 search results - page 20 / 168 » On the Complexity of Train Assignment Problems |
133
Voted
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We study – within the framework of propositional proof complexity – the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiabl...
139
Voted
AAIM
2005
Springer
15 years 9 months ago
2005
Springer
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
154
Voted
ISCA
2003
IEEE
15 years 9 months ago
2003
IEEE
This work examines dynamic cluster assignment for a clustered trace cache processor (CTCP). Previously proposed cluster assignment techniques run into unique problems as issue wid...
125
Voted
DCC
2006
IEEE
16 years 3 months ago
2006
IEEE
Optimal index assignment of multiple description lattice vector quantizer (MDLVQ) can be posed as a large-scale linear assignment problem. But is this expensive algorithmic approa...
128
Voted
ATAL
2006
Springer
15 years 7 months ago
2006
Springer
Assigning tasks to agents is complex, especially in highly dynamic environments. Typical protocol-based approaches for task assignment such as Contract Net have proven their value...