836 search results - page 2 / 168 » On the Complexity of Train Assignment Problems |
179
click to vote
INFOCOM
2006
IEEE
16 years 21 days ago
2006
IEEE
— We study the complexity of a spectrum of design problems for optical networks in order to carry a set of demands. Under wavelength division multiplexing (WDM) technology, deman...
216
click to vote
HICSS
2003
IEEE
15 years 12 months ago
2003
IEEE
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...
161
Voted
ISCIS
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. We investigate the problem of enumerating schedules, consisting of course-section assignments, in increasing order of the number of conflicts they contain. We define th...
229
Voted
DISOPT
2011
14 years 10 months ago
2011
We investigate a special case of the maximum quadratic assignment problem where one matrix is a product matrix and the other matrix is the distance matrix of a one-dimensional poi...
159
click to vote
ACL
2010
15 years 4 months ago
2010
We consider the search for a maximum likelihood assignment of hidden derivations and grammar weights for a probabilistic context-free grammar, the problem approximately solved by ...