Sciweavers

342 search results - page 23 / 69
» Automatic Generation of Heuristics for Scheduling
Sort
View
CIKM
1999
Springer
15 years 10 months ago
Training a Selection Function for Extraction
In this paper we compare performance of several heuristics in generating informative generic/query-oriented extracts for newspaper articles in order to learn how topic prominence ...
Chin-Yew Lin
160
Voted
GECCO
2007
Springer
236views Optimization» more  GECCO 2007»
15 years 12 months ago
A discrete differential evolution algorithm for the permutation flowshop scheduling problem
In this paper, a novel discrete differential evolution (DDE) algorithm is presented to solve the permutation flowhop scheduling problem with the makespan criterion. The DDE algori...
Quan-Qe Pan, Mehmet Fatih Tasgetiren, Yun-Chia Lia...
IPPS
1998
IEEE
15 years 10 months ago
Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
Peter R. Cappello, Ömer Egecioglu
AIR
2004
130views more  AIR 2004»
15 years 5 months ago
A Hybrid Framework for Over-Constrained Generalized
Abstract. In this work we study an over-constrained scheduling problem where constraints cannot be relaxed. This problem originates from a local defense agency where activities to ...
Andrew Lim, Brian Rodrigues, Ramesh Thangarajo, Fe...
CI
2000
134views more  CI 2000»
15 years 5 months ago
Choosing Rhetorical Structures to Plan Instructional Texts
This paper discusses a fundamental problem in natural language generation: how to organize the content of a text in a coherent and natural way. In this research, we set out to det...
Leila Kosseim, Guy Lapalme