50 search results - page 1 / 10 » Strict Sequential P-completeness |
NDJFL
1998
13 years 6 months ago
1998
We propose a combination of Bochvar’s strict three-valued logic, McCarthy’s sequential three-valued logic, and process algebra via the condi
PADS
2004
ACM
14 years 8 days ago
2004
ACM
This paper advocates the use of a formal framework for analyzing simulation performance. Simulation performance is characterized based on the three simulation development process ...
TLDI
2005
ACM
14 years 12 days ago
2005
ACM
Completely annotated lambda terms (such as are arrived at via the straightforward encodings of various types from System F) contain much redundant type information. Consequently, ...
ICDM
2010
IEEE
13 years 4 months ago
2010
IEEE
Discovering patterns in a sequence is an important aspect of data mining. One popular choice of such patterns are episodes, patterns in sequential data describing events that often...
STACS
1997
Springer
13 years 11 months ago
1997
Springer
In this paper we present a new notion of what it means for a problem in P to be inherently sequential. Informally, a problem L is strictly sequential P-complete if when the best kn...