846 search results - page 101 / 170 » On the Computational Complexity of Spatio-Temporal Logics |
163
click to vote
IPPS
2003
IEEE
15 years 11 months ago
2003
IEEE
Oscilloscopes and their cousins, logic analyzers, are the tools of choice for difficult electronic hardware problems. In the hands of a skilled engineer or technician, these tool...
158
click to vote
ECCC
2006
15 years 6 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
210
click to vote
KES
2007
Springer
2007
Springer
Inductive Concept Retrieval and Query Answering with Semantic Knowledge Bases Through Kernel Methods
16 years 10 days ago
This work deals with the application of kernel methods to structured relational settings such as semantic knowledge bases expressed in Description Logics. Our method integrates a n...
155
click to vote
JAIR
2008
15 years 6 months ago
2008
Shapley's impossibility result indicates that the two-person bargaining problem has no non-trivial ordinal solution with the traditional game-theoretic bargaining model. Alth...
135
click to vote
ICPR
2004
IEEE
16 years 7 months ago
2004
IEEE
This paper presents a novel extension of Hidden Markov Models (HMMs): type-2 fuzzy HMMs (type-2 FHMMs). The advantage of this extension is that it can handle both randomness and f...