2343 search results - page 171 / 469 » Visual-Concept Search Solved |
146
Voted
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
In this paper, a novel discrete differential evolution (DDE) algorithm is presented to solve the permutation flowhop scheduling problem with the makespan criterion. The DDE algori...
120
click to vote
CP
2005
Springer
15 years 10 months ago
2005
Springer
QBF is the problem of deciding the satisfiability of quantified boolean formulae in which variables can be either universally or existentially quantified. QBF generalizes SAT (S...
143
click to vote
CP
2008
Springer
15 years 6 months ago
2008
Springer
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...
154
Voted
IJCAI
1997
15 years 6 months ago
1997
This paper presents a technique, called GENH, that automatically generates search heuristics for scheduling problems. The impetus for developing this technique is the growing cons...
152
Voted
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Equal allocation of bandwidth and/or power may not be efficient for wireless multi-user networks with limited bandwidth and power resources. Joint bandwidth and power allocation s...