1387 search results - page 89 / 278 » Convexity in Discrete Space |
143
click to vote
COCOA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. This paper proposes a method to compute the transitive closure of a union of affine relations on integer tuples. Within Presburger arithmetics, complete algorithms to com...
124
click to vote
NA
2006
15 years 6 months ago
2006
Abstract. The present article summarizes the state of the art algorithms to compute the discrete Moreau envelope, and presents a new linear-time algorithm, named NEP for NonExpansi...
148
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
In this paper, the authors investigate the problem of designing an observer for Lipschitz nonlinear systems with discrete time measurements (continuous-discrete time systems). The ...
568
click to vote
COCOON
2011
Springer
14 years 6 months ago
2011
Springer
A d-dimensional polycube of size n is a connected set of n cubes in d dimensions, where connectivity is through (d−1)-dimensional faces. Enumeration of polycubes, and, in particu...
149
click to vote
AUSAI
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. Q-learning can be used to learn a control policy that maximises a scalar reward through interaction with the environment. Qlearning is commonly applied to problems with d...