2496 search results - page 215 / 500 » On covering by translates of a set |
169
click to vote
ACSC
2005
IEEE
16 years 8 days ago
2005
IEEE
One approach to tractably finding a solution to an NP-complete optimisation problem is heuristic, where the solution is inexact but quickly found; another approach is to reduce t...
225
Voted
CRYPTO
2001
Springer
15 years 11 months ago
2001
Springer
We deal with the problem of a center sending a message to a group of users such that some subset of the users is considered revoked and should not be able to obtain the content of...
200
click to vote
CIKM
1998
Springer
15 years 11 months ago
1998
Springer
An important investigation of time series involves searching for \movement" patterns, such as \going up" or \going down" or some combinations of them. Movement patt...
181
click to vote
COLT
2006
Springer
15 years 10 months ago
2006
Springer
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
172
click to vote
AUTOMATICA
2005
15 years 6 months ago
2005
This paper presents a method for enlarging the domain of attraction of nonlinear model predictive control (MPC). The usual way of guaranteeing stability of nonlinear MPC is to add...