1347 search results - page 41 / 270 » On the Structure of the Minimum Time Function |
TIT
2008
13 years 7 months ago
2008
We study the functional codes C2(X) defined on projective varieties X, in the case where X P3 is a 1-degenerate quadric or a non-degenerate quadric (hyperbolic or elliptic). We fi...
INFORMATICALT
2010
13 years 6 months ago
2010
In the previous papers (Pupeikis, 2000; Genov et al., 2006; Atanasov and Pupeikis, 2009), a direct approach for estimating the parameters of a discrete-time linear time-invariant (...
SAGT
2010
Springer
13 years 6 months ago
2010
Springer
The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that...
ECAL
2005
Springer
14 years 1 months ago
2005
Springer
This paper investigates evolvability of artificial neural networks within an artificial life environment. Five different structural mutations are investigated, including adaptive e...
AINA
2005
IEEE
14 years 1 months ago
2005
IEEE
2004, Chang et al. suggested an approach that solves the problem of secret sharing with access structures in a hierarchy. They used the concept of discrete logarithmto reuse shado...