9405 search results - page 24 / 1881 » Computing a Model of Set Theory |
PODC
2005
ACM
15 years 3 months ago
2005
ACM
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
CVPR
2005
IEEE
15 years 11 months ago
2005
IEEE
This paper presents a novel 3D deformable surface that we call an active polyhedron. Rooted in surface evolution theory, an active polyhedron is a polyhedral surface whose vertice...
ENTCS
2011
14 years 4 months ago
2011
We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, ‘Computational Complexity in Non-Turing Models of Computationâ...
RSCTC
2000
Springer
15 years 1 months ago
2000
Springer
This paper introduces a neural network architecture based on rough sets and rough membership functions. The neurons of such networks instantiate approximate reasoning in assessing ...
APN
2008
Springer
14 years 11 months ago
2008
Springer
In this paper, we address the class of bounded Petri nets with stopwatches (SwPNs), which is an extension of T-time Petri nets (TPNs) where time is associated with transitions. Con...