388 search results - page 13 / 78 » A Mixed Closure-CSP Method to Solve Scheduling Problems |
DATE
2010
IEEE
13 years 9 months ago
2010
IEEE
—Due to increase in demand for reconfigurability in embedded systems, real-time task scheduling is challenged by non-negligible reconfiguration overheads. If such overheads are n...
FLAIRS
2001
13 years 10 months ago
2001
Mixed-initiative learning integrates complementary human and automated reasoning, taking advantage of their respective reasoning styles and computational strengths in order to sol...
CCE
2011
13 years 10 days ago
2011
During the last 15 years, many mathematical models have been developed in order to solve process operation scheduling problems, using discrete or continuous time representations. ...
CSDA
2007
13 years 8 months ago
2007
In blind source separation, there are M sources that produce sounds independently and continuously over time. These sounds are then recorded by m receivers. The sound recorded by ...
CLOUDCOM
2010
Springer
13 years 6 months ago
2010
Springer
Inspired by Darwinian evolution, a genetic algorithm (GA) approach is one of the popular heuristic methods for solving hard problems, such as the Job Shop Scheduling Problem (JSSP...