228 search results - page 12 / 46 » Two Normal Forms for Rewriting P Systems |
WWW
2007
ACM
14 years 8 months ago
2007
ACM
This paper presents SRing, a structured non DHT P2P overlay that efficiently supports exact and range queries on multiple attribute values. In SRing, all attribute values are inte...
POPL
1994
ACM
13 years 11 months ago
1994
ACM
An important implementation decision in polymorphically typed functional programming languages is whether to represent data in boxed or unboxed form and when to transform them fro...
RTA
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. Declarative debugging is a semi-automatic technique that starts from an incorrect computation and locates a program fragment responsible for the error by building a tree ...
USENIX
2003
13 years 8 months ago
2003
We present an in-kernel disk prefetcher which uses speculative execution to determine what data an application is likely to require in the near future. By placing our design withi...
COMPSAC
2002
IEEE
14 years 10 days ago
2002
IEEE
The problem of testing from an extended finite state machine (EFSM) is complicated by the presence of infeasible paths. This paper considers the problem of expanding an EFSM in o...