5302 search results - page 44 / 1061 » Learning How to Separate |
DISOPT
2008
14 years 12 months ago
2008
At present, the most successful approach to solving large-scale instances of the Symmetric Traveling Salesman Problem to optimality is branch-and-cut. The success of branch-and-cu...
MP
2010
14 years 10 months ago
2010
Valid inequalities for 0-1 knapsack polytopes often prove useful when tackling hard 0-1 Linear Programming problems. To generate such inequalities, one needs separation algorithms...
KES
2007
Springer
15 years 6 months ago
2007
Springer
Bayesian Networks are proven to be a comprehensive model to describe causal relationships among domain attributes with probabilistic measure of conditional dependency. However, dep...
103
click to vote
GECCO
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. The performance of classification algorithms in machine learning is affected by the features used to describe the labeled examples presented to the inducers. Therefore,...
100
click to vote
ICSE
1998
IEEE-ACM
15 years 4 months ago
1998
IEEE-ACM
Joining a software development team is like moving to a new country to start employment; the immigrant has a lot to learn about the job, the local customs, and sometimes a new lan...