Sciweavers

1205 search results - page 172 / 241
» On P Systems with Bounded Parallelism
Sort
View
SAS
2009
Springer
147views Formal Methods» more  SAS 2009»
14 years 8 months ago
Polymorphic Fractional Capabilities
Abstract. The capability calculus is a framework for statically reasoning about program resources such as deallocatable memory regions. Fractional capabilities, originally proposed...
Hirotoshi Yasuoka, Tachio Terauchi
AIPS
2011
12 years 11 months ago
A Polynomial All Outcome Determinization for Probabilistic Planning
Most predominant approaches in probabilistic planning utilize techniques from the more thoroughly investigated field of classical planning by determinizing the problem at hand. I...
Thomas Keller, Patrick Eyerich
INFOCOM
2009
IEEE
14 years 2 months ago
Protecting Against Network Infections: A Game Theoretic Perspective
— Security breaches and attacks are critical problems in today’s networking. A key-point is that the security of each host depends not only on the protection strategies it choo...
Jasmina Omic, Ariel Orda, Piet Van Mieghem
DSN
2005
IEEE
14 years 1 months ago
Reversible Fault-Tolerant Logic
It is now widely accepted that the CMOS technology implementing irreversible logic will hit a scaling limit beyond 2016, and that the increased power dissipation is a major limiti...
P. Oscar Boykin, Vwani P. Roychowdhury
COCO
1994
Springer
100views Algorithms» more  COCO 1994»
13 years 11 months ago
Relative to a Random Oracle, NP is Not Small
Resource-bounded measure as originated by Lutz is an extension of classical measure theory which provides a probabilistic means of describing the relative sizes of complexity clas...
Steven M. Kautz, Peter Bro Miltersen