Sciweavers

14386 search results - page 395 / 2878
» The Chinese Generals Problem
Sort
View
ORL
2008
87views more  ORL 2008»
15 years 5 months ago
On-line scheduling with non-crossing constraints
We consider the problem of on-line scheduling with non-crossing constraints. The objective is to minimize the latest completion time. We provide optimal competitive ratio heuristi...
Lele Zhang, Kwanniti Khammuang, Andrew Wirth
GECCO
2008
Springer
129views Optimization» more  GECCO 2008»
15 years 8 months ago
Estimation of pump-curves using genetic algorithms
This paper presents a variety of different ways of estimating the general parameters for pump-curves. First a formulation is made that converts the problem into estimating four p...
Gerulf K. M. Pedersen, Zhenyu Yang
DIS
2000
Springer
15 years 11 months ago
A Practical Algorithm to Find the Best Subsequence Patterns
Given two sets of strings, consider the problem to find a subsequence that is common to one set but never appears in the other set. The problem is known to be NP-complete. We gene...
Masahiro Hirao, Hiromasa Hoshino, Ayumi Shinohara,...
PPSN
2000
Springer
15 years 10 months ago
An Analysis of Dynamic Severity and Population Size
This work introduces a general mathematical framework for non-stationary fitness functions which enables the exact definition of certain problem properties. The properties' in...
Karsten Weicker
AAAI
2004
15 years 8 months ago
An Effective Algorithm for Project Scheduling with Arbitrary Temporal Constraints
The resource-constrained project scheduling problem with time windows (RCPSP/max) is an important generalization of a number of well studied scheduling problems. In this paper, we...
Tristan B. Smith, John M. Pyle