Sciweavers

1723 search results - page 133 / 345
» Cycling in linear programming problems
Sort
View
ICIP
2003
IEEE
16 years 3 months ago
Sparse decompositions in "incoherent" dictionaries
The purpose of this paper is to generalize a result by Donoho, Huo, Elad and Bruckstein on sparse representations of signals/images in a union of two orthonormal bases. We conside...
Morten Nielsen, Rémi Gribonval
115
Voted
CPM
2010
Springer
140views Combinatorics» more  CPM 2010»
15 years 6 months ago
Bounds on the Minimum Mosaic of Population Sequences under Recombination
We study the minimum mosaic problem, an optimization problem originated in population genomics. We develop a new lower bound, called the C bound. The C bound is provably higher and...
Yufeng Wu
AUTOMATICA
2006
97views more  AUTOMATICA 2006»
15 years 1 months ago
Receding horizon control applied to optimal mine planning
In this paper we show that the problem of optimal mine planning can be cast in the framework of receding horizon control. Traditional formulations of this problem have cast it in ...
Graham C. Goodwin, María M. Seron, Richard ...
128
Voted
IJHIS
2007
89views more  IJHIS 2007»
15 years 1 months ago
A new hybrid heuristic for driver scheduling
This paper describes a new hybrid method based on the application of the Population Training Algorithm (PTA) and linear programming (LP) for generation of schedules for drivers in...
Geraldo R. Mauri, Luiz Antonio Nogueira Lorena
120
Voted
IOR
2007
82views more  IOR 2007»
15 years 1 months ago
Compensating for Failures with Flexible Servers
We consider the problem of maximizing capacity in a queueing network with flexible servers, where the classes and servers are subject to failure. We assume that the interarrival ...
Sigrún Andradóttir, Hayriye Ayhan, D...