7978 search results - page 236 / 1596 » Combining shared-coin algorithms |
128
click to vote
JSSPP
2004
Springer
15 years 9 months ago
2004
Springer
Using a single traditional gang scheduling algorithm cannot provide the best performance for all workloads and parallel architectures. A solution for this problem is the use of...
148
click to vote
CP
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
122
click to vote
FSTTCS
2001
Springer
15 years 9 months ago
2001
Springer
Semidefinite programming based approximation algorithms, such as the Goemans and Williamson approximation algorithm for the MAX CUT problem, are usually shown to have certain perf...
146
click to vote
CCECE
2006
IEEE
15 years 8 months ago
2006
IEEE
This paper presents a forgetting factor scheme for variable step-size affine projection algorithms (APA). The proposed scheme uses a forgetting processed input matrix as the projec...
145
click to vote
GECCO
2000
Springer
15 years 8 months ago
2000
Springer
The majority of the research using evolutionary algorithms for the Job Shop Scheduling Problem (JSSP) has studied only the static JSSP. Few evolutionary algorithms have been appli...