The following pages link to Jan H. M. Korst (Q1119181):
Displaying 19 items.
- Random duplicate storage strategies for load balancing in multimedia servers (Q294850) (← links)
- Computer-assisted proof of performance ratios for the differencing method (Q435724) (← links)
- Theoretical aspects of local search. (Q859710) (← links)
- Performance ratios of the Karmarkar-Karp differencing method (Q867023) (← links)
- Complexity of min-max subsequence problems (Q1014423) (← links)
- Boltzmann machines for travelling salesman problems (Q1119182) (← links)
- Computations in massively parallel networks based on the Boltzmann machine: A review (Q1123130) (← links)
- Periodic assignment and graph colouring (Q1329789) (← links)
- Fast concurrent access to parallel disks (Q1566373) (← links)
- (Q1909002) (redirect page) (← links)
- A variable-depth search algorithm for the recursive bipartitioning of signal flow graphs (Q1909003) (← links)
- A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem. (Q1963624) (← links)
- Improved metaheuristics for the quartet method of hierarchical clustering (Q2022207) (← links)
- An exact algorithm for the minimum quartet tree cost problem (Q2283933) (← links)
- Bus and buffer usage in in-home digital networks: applying the dantzig-wolfe decomposition (Q2464411) (← links)
- Boltzmann machines as a model for parallel annealing (Q2638943) (← links)
- (Q2776543) (← links)
- (Q3035154) (← links)
- Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems (Q5322133) (← links)
