Sciweavers

1550 search results - page 197 / 310
» Optimizing search by showing results in context
Sort
View
JAIR
2006
121views more  JAIR 2006»
15 years 6 months ago
How the Landscape of Random Job Shop Scheduling Instances Depends on the Ratio of Jobs to Machines
We characterize the search landscape of random instances of the job shop scheduling problem (JSP). Specifically, we investigate how the expected values of (1) backbone size, (2) d...
Matthew J. Streeter, Stephen F. Smith
KDD
2012
ACM
187views Data Mining» more  KDD 2012»
13 years 8 months ago
Online learning to diversify from implicit feedback
In order to minimize redundancy and optimize coverage of multiple user interests, search engines and recommender systems aim to diversify their set of results. To date, these dive...
Karthik Raman, Pannaga Shivaswamy, Thorsten Joachi...
TKDE
2011
176views more  TKDE 2011»
15 years 1 months ago
Experience Transfer for the Configuration Tuning in Large-Scale Computing Systems
—This paper proposes a new strategy, the experience transfer, to facilitate the management of large-scale computing systems. It deals with the utilization of management experienc...
Haifeng Chen, Wenxuan Zhang, Guofei Jiang
CVPR
2009
IEEE
17 years 1 months ago
Continuous Maximal Flows and Wulff Shapes: Application to MRFs
Convex and continuous energy formulations for low level vision problems enable efficient search procedures for the corresponding globally optimal solutions. In this work we exte...
Christopher Zach (UNC Chapel Hill), Marc Niethamme...
GECCO
2005
Springer
126views Optimization» more  GECCO 2005»
15 years 12 months ago
Not all linear functions are equally difficult for the compact genetic algorithm
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...
Stefan Droste