Sciweavers

908 search results - page 89 / 182
» Heuristic Methods for Solving Job-Shop Scheduling Problems
Sort
View
VLDB
1998
ACM
82views Database» more  VLDB 1998»
15 years 7 months ago
Resource Scheduling for Composite Multimedia Objects
Scheduling algorithms for composite multimedia presentations need to ensure that the user-defined synchronization constraints for the various presentation components are met. This...
Minos N. Garofalakis, Yannis E. Ioannidis, Banu &O...
127
Voted
JMLR
2006
145views more  JMLR 2006»
15 years 3 months ago
Ensemble Pruning Via Semi-definite Programming
An ensemble is a group of learning models that jointly solve a problem. However, the ensembles generated by existing techniques are sometimes unnecessarily large, which can lead t...
Yi Zhang 0006, Samuel Burer, W. Nick Street
124
Voted
GECCO
2009
Springer
133views Optimization» more  GECCO 2009»
15 years 8 months ago
Evolutionary codings and operators for the terminal assignment problem
Given a collection of terminals, each with a demand, a collection of concentrators, each with a capacity, and costs of connecting the terminals to the concentrators, the terminal ...
Bryant A. Julstrom
GECCO
2010
Springer
200views Optimization» more  GECCO 2010»
15 years 8 months ago
Multivariate multi-model approach for globally multimodal problems
This paper proposes an estimation of distribution algorithm (EDA) aiming at addressing globally multimodal problems, i.e., problems that present several global optima. It can be r...
Chung-Yao Chuang, Wen-Lian Hsu
GECCO
2009
Springer
152views Optimization» more  GECCO 2009»
15 years 8 months ago
A data-based coding of candidate strings in the closest string problem
Given a set of strings S of equal lengths over an alphabet Σ, the closest string problem seeks a string over Σ whose maximum Hamming distance to any of the given strings is as s...
Bryant A. Julstrom