1743 search results - page 19 / 349 » Generalized Modal Satisfiability |
ENTCS
2002
13 years 9 months ago
2002
We show how coalgebras can be presented by operations and equations. This is a special case of Linton's approach to algebras over a general base category X, namely where X is...
CODES
2005
IEEE
14 years 3 months ago
2005
IEEE
Instruction-set extensible processors allow an existing processor core to be extended with application-specific custom instructions. In this paper, we explore a novel application...
DATE
1999
IEEE
14 years 2 months ago
1999
IEEE
The problem of checking the equivalence of combinational circuits is of key significance in the verification of digital circuits. In recent years, several approaches have been pro...
AMAI
2000
Springer
14 years 1 months ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Comp...
CIKM
2008
Springer
13 years 12 months ago
2008
Springer
Finding biological entities (such as genes or proteins) that satisfy certain conditions from texts is an important and challenging task in biomedical information retrieval and tex...