Sciweavers

14739 search results - page 300 / 2948
» An optimization problem on the sphere
Sort
View
COR
2011
14 years 6 months ago
A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem
: In this paper, we study the job shop scheduling problem with the objective of minimizing the total weighted tardiness. We propose a hybrid shifting bottleneck - tabu search (SB-T...
Kerem Bülbül
MA
2011
Springer
219views Communications» more  MA 2011»
14 years 6 months ago
Quadratic minimisation problems in statistics
We consider the problem minx(x−t) A(x−t) subject to x Bx + 2b x = k where A is positive definite or positive semidefinite. Commonly occurring statistical variants of this pro...
Casper J. Albers, Frank Critchley, John C. Gower
PROCEDIA
2011
14 years 2 months ago
Exact Closest String as a Constraint Satisfaction Problem
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
Tom Kelsey, Lars Kotthoff
POPL
2010
ACM
15 years 6 months ago
Compress-and-conquer for optimal multicore computing
We propose a programming paradigm called compress-and-conquer (CC) that leads to optimal performance on multicore platforms. Given a multicore system of p cores and a problem of s...
Zhijing G. Mou, Hai Liu, Paul Hudak
ICIP
1997
IEEE
16 years 26 days ago
Using mean field annealing to solve anisotropic diffusion problems
Anisotropic diffusion is a powerful method for image feature extraction in which blurring is allowed to occur except at edges. Mean field annealing (MFA) is an image optimization ...
Hairong Qi, Wesley E. Snyder, Griff L. Bilbro