Sciweavers

306 search results - page 11 / 62
» On the Minimal Uncompletable Word Problem
Sort
View
FORMATS
2007
Springer
14 years 1 months ago
Undecidability of Universality for Timed Automata with Minimal Resources
Timed automata were introduced by Alur and Dill in the early 1990s and have since become the most prominent modelling formalism for real-time systems. A fundamental limit to the al...
Sara Adams, Joël Ouaknine, James Worrell
INFORMS
2010
147views more  INFORMS 2010»
13 years 4 months ago
Exact Algorithms for the Quadratic Linear Ordering Problem
The quadratic linear ordering problem naturally generalizes various optimization problems, such as bipartite crossing minimization or the betweenness problem, which includes linear...
Christoph Buchheim, Angelika Wiegele, Lanbo Zheng
SCALESPACE
2007
Springer
14 years 1 months ago
Bounds on the Minimizers of (nonconvex) Regularized Least-Squares
This is a theoretical study on the minimizers of cost-functions composed of an ℓ2 data-fidelity term and a possibly nonsmooth or nonconvex regularization term acting on the di...
Mila Nikolova
CORR
2010
Springer
138views Education» more  CORR 2010»
13 years 7 months ago
On building minimal automaton for subset matching queries
We address the problem of building an index for a set D of n strings, where each string location is a subset of some finite integer alphabet of size , so that we can answer effici...
Kimmo Fredriksson
SIAMJO
2008
212views more  SIAMJO 2008»
13 years 7 months ago
Convergence Rate of an Optimization Algorithm for Minimizing Quadratic Functions with Separable Convex Constraints
A new active set algorithm for minimizing quadratic functions with separable convex constraints is proposed by combining the conjugate gradient method with the projected gradient. ...
Radek Kucera