Sciweavers

1808 search results - page 138 / 362
» Optimizing cost and performance for multihoming
Sort
View
GECCO
2008
Springer
156views Optimization» more  GECCO 2008»
13 years 9 months ago
Computing minimum cuts by randomized search heuristics
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
Frank Neumann, Joachim Reichel, Martin Skutella
ML
2006
ACM
13 years 8 months ago
Type-sensitive control-flow analysis
Higher-order typed languages, such as ML, provide strong support for data and type abn. While such abstraction is often viewed as costing performance, there are situations where i...
John H. Reppy
SIGIR
2005
ACM
14 years 1 months ago
Robustness of adaptive filtering methods in a cross-benchmark evaluation
This paper reports a cross-benchmark evaluation of regularized logistic regression (LR) and incremental Rocchio for adaptive filtering. Using four corpora from the Topic Detection...
Yiming Yang, Shinjae Yoo, Jian Zhang, Bryan Kisiel
CP
2011
Springer
12 years 8 months ago
Algorithm Selection and Scheduling
Algorithm portfolios aim to increase the robustness of our ability to solve problems efficiently. While recently proposed algorithm selection methods come ever closer to identifyin...
Serdar Kadioglu, Yuri Malitsky, Ashish Sabharwal, ...
INFOCOM
2006
IEEE
14 years 2 months ago
Nomadic Service Points
— We consider the novel problem of dynamically assigning application sessions of mobile users or user groups to service points. Such assignments must balance the tradeoff between...
Edward Bortnikov, Israel Cidon, Idit Keidar