908 search results - page 105 / 182 » Heuristic Methods for Solving Job-Shop Scheduling Problems |
145
click to vote
SIGMOD
2010
ACM
15 years 1 months ago
2010
ACM
Tuning tools attempt to configure a database to achieve optimal performance for a given workload. Selecting an optimal set of physical structures is computationally hard since it ...
164
Voted
ROBOCUP
2004
Springer
15 years 9 months ago
2004
Springer
The existing reinforcement learning approaches have been suffering from the policy alternation of others in multiagent dynamic environments such as RoboCup competitions since othe...
130
Voted
EVOW
2010
Springer
15 years 7 months ago
2010
Springer
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...
138
Voted
ATAL
2003
Springer
15 years 8 months ago
2003
Springer
Distributed problem solving by a multiagent system represents a promising approach to solving complex computational problems. However, many multiagent systems require certain degr...
105
click to vote
WWW
2002
ACM
16 years 4 months ago
2002
ACM
We addressed two issues concerning the practical aspects of optimally scheduling web advertising proposed by Langheinrich et al. [5], which scheduling maximizes the total number o...