908 search results - page 164 / 182 » Heuristic Methods for Solving Job-Shop Scheduling Problems |
112
click to vote
ATAL
2009
Springer
15 years 6 months ago
2009
Springer
Predictable allocations of security resources such as police officers, canine units, or checkpoints are vulnerable to exploitation by attackers. Recent work has applied game-theo...
DCOSS
2006
Springer
15 years 3 months ago
2006
Springer
We propose a generic communication primitive designed for sensor networks. Our primitive hides details of network communication while retaining sufficient programmer control over t...
120
click to vote
DAWAK
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. In this paper, we propose a novel mining task: mining frequent superset from the database of itemsets that is useful in bioinformatics, e-learning systems, jobshop schedu...
GECCO
2007
Springer
15 years 5 months ago
2007
Springer
The resolution of a Multi-Objective Optimization Problem (MOOP) does not end when the Pareto-optimal set is found. In real problems, a single solution must be selected. Ideally, t...
103
click to vote
DEXA
2005
Springer
15 years 5 months ago
2005
Springer
The main challenge of mining sequential patterns is the high processing cost of support counting for large amount of candidate patterns. For solving this problem, SPAM algorithm wa...