656 search results - page 15 / 132 » Minimal non-convex words |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
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...
AUTOMATICA
2006
14 years 9 months ago
2006
This paper is concerned with outer approximations of the minimal disturbance invariant set (MDIS) of a discrete-time linear system with an additive set-bounded disturbance. The k-...
MP
2006
14 years 9 months ago
2006
A method is proposed for finding the global minimum of a multivariate polynomial via sum of squares (SOS) relaxation over its gradient variety. That variety consists of all points ...
83
Voted
IJAIT
2007
14 years 9 months ago
2007
In this paper, we study the unrelated parallel machine problem for minimizing the makespan, which is NP-hard. We used Simulated Annealing (SA) and Tabu Search (TS) with Neighborho...
SIAMJO
2008
14 years 9 months ago
2008
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. ...