306 search results - page 7 / 62 » On the Minimal Uncompletable Word Problem |
MOR
2010
13 years 5 months ago
2010
The goal of the current paper is to introduce the notion of certificates which verify the accuracy of solutions of computational problems with convex structure; such problems inc...
NC
2002
13 years 7 months ago
2002
This paper presents an overview of our most recent results concerning the Particle Swarm Optimization (PSO) method. Techniques for the alleviation of local minima, and for detectin...
INFORMATICALT
2006
13 years 7 months ago
2006
We study single machine scheduling problems, where processing times of the jobs are exponential functions of their start times. For increasing functions, we prove strong NP-hardnes...
ORL
2008
13 years 5 months ago
2008
We consider the problem of on-line scheduling with non-crossing constraints. The objective is to minimize the latest completion time. We provide optimal competitive ratio heuristi...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
In this paper we consider general rank minimization problems with rank appearing in either objective function or constraint. We first show that a class of matrix optimization prob...