14649 search results - page 378 / 2930 » Principles of problem solving |
156
click to vote
FSTTCS
2008
Springer
15 years 7 months ago
2008
Springer
ABSTRACT. We study the algorithmic complexity of lattice problems based on Ajtai-Kumar-Sivakumar sieving technique [AKS01]. Given a k-dimensional subspace M ⊆ Rn and a full rank ...
161
click to vote
AMC
2010
15 years 6 months ago
2010
This work is concerned with the structure of bilinear minimization problems arising in recovering subsampled and modulated images in parallel magnetic resonance imaging. By consid...
190
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
This paper presents a novel methodology to develop scheduling algorithms. The scheduling problem is phrased as a control problem, and control-theoretical techniques are used to de...
133
click to vote
DISOPT
2008
15 years 6 months ago
2008
Abstract. Let the graph G = (V, E) be a cycle with n + 1 vertices, nonnegative vertex weights and positive edge lengths. The inverse 1-median problem on a cycle consists in changin...
167
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We study the problem of preemptive scheduling n jobs with given release times on m identical parallel machines. The objective is to minimize the average flow time. We show that wh...