1242 search results - page 56 / 249 » A Computational Complexity Theory in Membrane Computing |
LPNMR
2009
Springer
15 years 4 months ago
2009
Springer
Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which a...
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
This paper analyzes the complexity of problems from class field theory. Class field theory can be used to show the existence of infinite families of number fields with constant ro...
CHI
2005
ACM
15 years 10 months ago
2005
ACM
We explore the concept of social landmarks in complex, shared information and coordination environments. Previous research in navigation and shared spaces has tended to emphasize ...
CODES
2007
IEEE
15 years 4 months ago
2007
IEEE
The design and analysis of today’s complex real-time systems requires advanced methods. Due to ever growing functionality, hardware complexity and component interaction, applyin...