656 search results - page 74 / 132 » A Formalization of Transition P Systems |
164
Voted
LATA
2010
Springer
15 years 8 months ago
2010
Springer
Automated reasoning about systems with infinite domains requires an extension of regular automata to infinite alphabets. Existing formalisms of such automata cope with the infinite...
118
click to vote
CL
2007
Springer
15 years 4 months ago
2007
Springer
Semanticsofskeleton-basedparallelprogramminglanguagescomesusuallyastwodistinctitems:afunctionalsemantics,modeling the function computed by the skeleton program, and a parallel sem...
125
click to vote
JAIR
2006
15 years 4 months ago
2006
In this paper we present pddl+, a planning domain description language for modelling mixed discrete-continuous planning domains. We describe the syntax and modelling style of pddl...
214
click to vote
MEMOCODE
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract--This paper shows an implementation of CANSCID (Combined Architecture for Stream Categorization and Intrusion Detection). To satisfy the required system throughput, the pa...
115
click to vote
INFOCOM
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract—In order to improve scalability and reduce maintenance overhead for structured Peer-to-Peer systems, researchers design optimal architectures with constant degree and lo...