Sciweavers

5372 search results - page 152 / 1075
» complexity 2007
Sort
View
ISSAC
2007
Springer
88views Mathematics» more  ISSAC 2007»
14 years 2 months ago
Polynomial-time algorithm for Hilbert series of Borel type ideals
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 ...
Amir Hashemi
BROADNETS
2007
IEEE
13 years 12 months ago
Reinforcement learning based routing in all-optical networks with physical impairments
Abstract-- We present and evaluate a reinforcement learningbased RWA algorithm for all-optical networks subject to physical impairments. The technique is suitable for decentralized...
Yvan Pointurier, Fariba Heidari
COCO
2007
Springer
94views Algorithms» more  COCO 2007»
13 years 12 months ago
On Approximate Majority and Probabilistic Time
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...
Emanuele Viola
CSC
2006
13 years 9 months ago
An Adaptive Method for Flow Simulation in Three-Dimensional Heterogeneous Discrete Fracture Networks
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...
Hussein Mustapha
COMPLEXITY
2007
94views more  COMPLEXITY 2007»
13 years 8 months ago
Emergence is coupled to scope, not level
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...
Alex J. Ryan