Sciweavers

384 search results - page 73 / 77
» Representing Sequences in Description Logics
Sort
View
IJFCS
2006
130views more  IJFCS 2006»
13 years 7 months ago
Mealy multiset automata
We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Mo...
Gabriel Ciobanu, Viorel Mihai Gontineac
BMCBI
2008
214views more  BMCBI 2008»
13 years 7 months ago
Accelerating String Set Matching in FPGA Hardware for Bioinformatics Research
Background: This paper describes techniques for accelerating the performance of the string set matching problem with particular emphasis on applications in computational proteomic...
Yoginder S. Dandass, Shane C. Burgess, Mark Lawren...
IEEESCC
2007
IEEE
14 years 1 months ago
Deriving executable BPEL from UMM Business Transactions
UN/CEFACT’s Modeling Methodology (UMM) is a UML profile for modeling global B2B choreographies. The basic building blocks of UMM are business transactions, which describe the e...
Birgit Hofreiter, Christian Huemer, Philipp Liegl,...
TSE
1998
129views more  TSE 1998»
13 years 7 months ago
Inferring Declarative Requirements Specifications from Operational Scenarios
—Scenarios are increasingly recognized as an effective means for eliciting, validating, and documenting software requirements. This paper concentrates on the use of scenarios for...
Axel van Lamsweerde, Laurent Willemet
CADE
2005
Springer
14 years 7 months ago
An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard