Sciweavers

725 search results - page 28 / 145
» heuristics 2010
Sort
View
AIPS
2010
14 years 13 days ago
The Joy of Forgetting: Faster Anytime Search via Restarting
Anytime search algorithms solve optimisation problems by quickly finding a usually suboptimal solution and then finding improved solutions when given additional time. To deliver a...
Silvia Richter, Jordan Tyler Thayer, Wheeler Ruml
PDP
2010
IEEE
14 years 3 months ago
DAG Scheduling Using a Lookahead Variant of the Heterogeneous Earliest Finish Time Algorithm
Abstract—Among the numerous DAG scheduling heuristics suitable for heterogeneous systems, the Heterogeneous Earliest Finish Time (HEFT) heuristic is known to give good results in...
Luiz F. Bittencourt, Rizos Sakellariou, Edmundo R....
EOR
2006
44views more  EOR 2006»
13 years 10 months ago
The multiple-job repair kit problem
The repair kit problem is that of finding the optimal set of parts in the kit of a repairman. An important aspect of this problem, in many real-life situations, is that several jo...
Ruud H. Teunter
JDCTA
2010
135views more  JDCTA 2010»
13 years 4 months ago
Signal Framing Methods of Automotive Embedded Networked Control System for Bandwidth Consumption Optimization
Parameter (or variable) of automotive embedded networked control system is named as signal. In order to improve system performance and provide more remaining bandwidth for system ...
Jian Hu, Gangyan Li, Yeqiong Song
JCO
2010
87views more  JCO 2010»
13 years 4 months ago
On-line machine scheduling with batch setups
We study a class of scheduling problems with batch setups for the online-list and online-time paradigms. Jobs are to be scheduled in batches for processing. All jobs in a batch st...
Lele Zhang, Andrew Wirth