836 search results - page 36 / 168 » On the Complexity of Train Assignment Problems |
115
Voted
INFOVIS
2000
IEEE
15 years 8 months ago
2000
IEEE
COMIND is a tool for conceptual design of industrial products. It helps designers define and evaluate the initial design space by using search algorithms to generate sets of feasi...
129
click to vote
WIOPT
2010
IEEE
2010
IEEE
Low complexity algorithms for relay selection and power control in interference-limited environments
15 years 2 months ago
Abstract—We consider an interference-limited wireless network, where multiple source-destination pairs compete for the same pool of relay nodes. In an attempt to maximize the sum...
164
Voted
ECTEL
2008
Springer
15 years 5 months ago
2008
Springer
Modeling the cognitive processes of learners is fundamental to build educational software that are autonomous and that can provide highly tailored assistance during learning [3]. F...
143
Voted
FLAIRS
2006
15 years 5 months ago
2006
Text categorization involves mapping of documents to a fixed set of labels. A similar but equally important problem is that of assigning labels to large corpora. With a deluge of ...
134
click to vote
ALGORITHMICA
2010
15 years 3 months ago
2010
We consider the following version of the stable matching problem. Suppose that men have preferences for women, women have preferences for dogs, and dogs have preferences for men. T...