Sciweavers

1813 search results - page 220 / 363
» Instance Pruning Techniques
Sort
View
CORR
2008
Springer
129views Education» more  CORR 2008»
15 years 6 months ago
Bounds on Codes Based on Graph Theory
"THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD" Let Aq(n, d) be the maximum order (maximum number of codewords) of a q-ary code of length n and Hamming distance at l...
Salim Y. El Rouayheb, Costas N. Georghiades, Emina...
EOR
2008
75views more  EOR 2008»
15 years 6 months ago
GRASP and path relinking for project scheduling under partially renewable resources
Recently, in the field of project scheduling problems the concept of partially renewable resources has been introduced. Theoretically, it is a generalization of both renewable and...
Ramón Alvarez-Valdés, Enric Crespo, ...
IEE
2008
108views more  IEE 2008»
15 years 6 months ago
Mining execution relations for crosscutting concerns
Aspect mining tries to identify crosscutting concerns in the code of existing systems and thus supports their adaption to an aspect-oriented design. A semi-automatic static aspect...
Jens Krinke
COR
2006
118views more  COR 2006»
15 years 6 months ago
Accelerating column generation for aircraft scheduling using constraint propagation
We discuss how constraint programming can improve the performance of a column generation solution process for the NP-hard Tail Assignment problem in aircraft scheduling. Combining...
Mattias Grönkvist
ECOI
2006
59views more  ECOI 2006»
15 years 6 months ago
Model-building with interpolated temporal data
Ecological data can be difficult to collect, and as a result, some important temporal ecological datasets contain irregularly sampled data. Since many temporal modelling technique...
Robert I. McKay, Tuan Hao Hoang, Naoki Mori, Nguye...