Sciweavers

289 search results - page 30 / 58
» Regular Linear Temporal Logic
Sort
View
146
Voted
DEON
2010
Springer
15 years 5 months ago
A Dyadic Operator for the Gradation of Desirability
We propose a normal modal deontic logic based on a dyadic operator, similar in structure to the temporal "until". By bringing significant expressiveness to the logic, it ...
Guillaume Piolle
LFCS
2007
Springer
15 years 10 months ago
Model Checking Knowledge and Linear Time: PSPACE Cases
We present a general algorithm scheme for model checking logics of knowledge, common knowledge and linear time, based on simulations to a class of structures that capture the way t...
Kai Engelhardt, Peter Gammie, Ron van der Meyden
DCOSS
2008
Springer
15 years 5 months ago
Distributed Activity Recognition with Fuzzy-Enabled Wireless Sensor Networks
Wireless sensor nodes can act as distributed detectors for recognizing activities online, with the final goal of assisting the users in their working environment. We propose an act...
Mihai Marin-Perianu, Clemens Lombriser, Oliver Amf...
RECONFIG
2008
IEEE
224views VLSI» more  RECONFIG 2008»
15 years 10 months ago
Automatic Construction of Large-Scale Regular Expression Matching Engines on FPGA
—We present algorithms for implementing large-scale regular expression matching (REM) on FPGA. Based on the proposed algorithms, we develop tools that first transform regular ex...
Yi-Hua E. Yang, Viktor K. Prasanna
ICCS
2005
Springer
15 years 9 months ago
A Logarithmic Time Method for Two's Complementation
This paper proposes an innovative algorithm to find the two’s complement of a binary number. The proposed method works in logarithmic time (O(logN)) instead of the worst case li...
Jung-Yup Kang, Jean-Luc Gaudiot