In this paper, it is shown that the Hilbert series of a Borel type ideal may be computed within a complexity which is polynomial in Dn where n + 1 is the number of unknowns and D ...
Abstract-- We present and evaluate a reinforcement learningbased RWA algorithm for all-optical networks subject to physical impairments. The technique is suitable for decentralized...
We prove new results on the circuit complexity of Approximate Majority, which is the problem of computing Majority of a given bit string whose fraction of 1's is bounded away...
Natural fractured media are highly unpredictable because of existing complex structures at the fracture and at the network levels. Fractures are by themselves heterogeneous objects...
Since its application to systems, emergence has been explained in terms of levels of observation. This approach has led to confusion, contradiction, incoherence and at times mysti...