Sciweavers

442 search results - page 44 / 89
» Model Checking of Systems Employing Commutative Functions
Sort
View
AAAI
2006
13 years 10 months ago
Fast SAT-based Answer Set Solver
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...
Zhijun Lin, Yuanlin Zhang, Hector Hernandez
BIB
2007
139views more  BIB 2007»
13 years 8 months ago
Petri net modelling of biological networks
Mathematical modelling is increasingly used to get insights into the functioning of complex biological networks. In this context, Petri nets (PNs) have recently emerged as a promi...
Claudine Chaouiya
TSP
2010
13 years 3 months ago
A multi-resolution hidden Markov model using class-specific features
We address the problem in signal classification applications, such as automatic speech recognition (ASR) systems that employ the hidden Markov model (HMM), that it is necessary to...
Paul M. Baggenstoss
DAC
2007
ACM
14 years 9 months ago
A System For Coarse Grained Memory Protection In Tiny Embedded Processors
Many embedded systems contain resource constrained microcontrollers where applications, operating system components and device drivers reside within a single address space with no...
Ram Kumar, Akhilesh Singhania, Andrew Castner, Edd...
TACAS
2004
Springer
135views Algorithms» more  TACAS 2004»
14 years 1 months ago
Liveness with Incomprehensible Ranking
Abstract. The methods of Invisible Invariants and Invisible Ranking were developed originally in order to verify temporal properties of parameterized systems in a fully automatic m...
Yi Fang, Nir Piterman, Amir Pnueli, Lenore D. Zuck