836 search results - page 11 / 168 » On the Complexity of Train Assignment Problems |
ICML
2004
IEEE
15 years 10 months ago
2004
IEEE
Conditional Random Fields (CRFs; Lafferty, McCallum, & Pereira, 2001) provide a flexible and powerful model for learning to assign labels to elements of sequences in such appl...
ICLP
1997
Springer
15 years 1 months ago
1997
Springer
Array updates in single assignment languages generally require some copying of the array, and thus tend to be more expensive than in imperative languages. As a result, programs in...
71
Voted
ANOR
2010
14 years 9 months ago
2010
Two metaheuristic methods based on Tabu search are introduced to assign judges to individual competitions in a tournament. The complexity of the mathematical formulation accounting...
ICC
2009
IEEE
15 years 4 months ago
2009
IEEE
—We consider a system with a single base station communicating with multiple users over orthogonal channels while being assisted by multiple relays. Several recent works have sug...
SECON
2008
IEEE
15 years 3 months ago
2008
IEEE
— We address the problem of congestion control in multi-radio, multi-channel, wireless mesh networks. Compared to its single radio counterpart for which solutions exist, this pro...