846 search results - page 112 / 170 » On the Computational Complexity of Spatio-Temporal Logics |
212
click to vote
ISVLSI
2005
IEEE
15 years 11 months ago
2005
IEEE
high NRE cost. Therefore, general purpose programmable processors using software to perform various functions become more attractive since programmability can simplify system devel...
191
click to vote
DATE
1998
IEEE
15 years 10 months ago
1998
IEEE
As the "system-on-a-chip" concept is rapidly becoming a reality, time-to-market and product complexity push the reuse of complex macromodules. Circuits combining a varie...
124
click to vote
ICCAD
2005
IEEE
16 years 3 months ago
2005
IEEE
State-equivalence based reduction techniques, e.g. bisimulation minimization, can be used to reduce a state transition system to facilitate subsequent verification tasks. However...
179
click to vote
EPIA
2007
Springer
16 years 10 days ago
2007
Springer
Recently, the logics of minimal knowledge and negation as failure MKNF [12] was used to introduce hybrid MKNF knowledge bases [14], a powerful formalism for combining open and clos...
160
click to vote
ECML
2003
Springer
15 years 11 months ago
2003
Springer
A central issue in logical concept induction is the prospect of inconsistency. This problem may arise due to noise in the training data, or because the target concept does not fit...