Sciweavers

72 search results - page 14 / 15
» Learning Heuristic Functions through Approximate Linear Prog...
Sort
View
EOR
2006
148views more  EOR 2006»
13 years 5 months ago
Pareto ant colony optimization with ILP preprocessing in multiobjective project portfolio selection
One of the most important, common and critical management issues lies in determining the "best" project portfolio out of a given set of investment proposals. As this dec...
Karl F. Doerner, Walter J. Gutjahr, Richard F. Har...
INFOCOM
2012
IEEE
11 years 8 months ago
On exploiting flow allocation with rate adaptation for green networking
Abstract—Network power consumption can be reduced considerably by adapting link data rates to their offered traffic loads. In this paper, we exploit how to leverage rate adaptat...
Jian Tang, Brendan Mumey, Yun Xing, Andy Johnson
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 6 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
ML
2008
ACM
101views Machine Learning» more  ML 2008»
13 years 5 months ago
On reoptimizing multi-class classifiers
Significant changes in the instance distribution or associated cost function of a learning problem require one to reoptimize a previously-learned classifier to work under new cond...
Chris Bourke, Kun Deng, Stephen D. Scott, Robert E...
GECCO
2003
Springer
415views Optimization» more  GECCO 2003»
13 years 11 months ago
Evolutionary Algorithms for Two Problems from the Calculus of Variations
Abstract. A brachistochrone is the path along which a weighted particle falls most quickly from one point to another, and a catenary is the smooth curve connecting two points whose...
Bryant A. Julstrom