836 search results - page 113 / 168 » On the Complexity of Train Assignment Problems |
136
click to vote
ALENEX
2004
15 years 5 months ago
2004
We consider two approaches that model timetable information in public transportation systems as shortestpath problems in weighted graphs. In the time-expanded approach every event...
143
Voted
AI
2008
Springer
15 years 4 months ago
2008
Springer
Preference learning is a challenging problem that involves the prediction of complex structures, such as weak or partial order relations, rather than single values. In the recent ...
139
Voted
ML
2006
ACM
15 years 4 months ago
2006
ACM
Backpropagation, similar to most learning algorithms that can form complex decision surfaces, is prone to overfitting. This work presents classification-based objective functions, ...
116
Voted
KDD
2005
ACM
15 years 9 months ago
2005
ACM
This paper describes TIPPPS (Time Interleaved Product Purchase Prediction System), which analyses billing data of corporate customers in a large telecommunications company in orde...
198
click to vote
BMCBI
2005
15 years 4 months ago
2005
Background: Synthetic lethality experiments identify pairs of genes with complementary function. More direct functional associations (for example greater probability of membership...