846 search results - page 98 / 170 » On the Computational Complexity of Spatio-Temporal Logics |
163
click to vote
FPL
1999
Springer
15 years 10 months ago
1999
Springer
This paper details the development, implementation, and results of Synthia, a system for the synthesis of Finite State Machines (FSMs) to field-programmable logic. Our approach us...
177
click to vote
RSCTC
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. In this paper, we discuss approximation spaces in a granular computing framework. Such approximation spaces generalise the approaches to concept approximation existing in...
176
click to vote
CONTEXT
2003
Springer
15 years 11 months ago
2003
Springer
The development of more and more complex distributed applications over large networks of computers has raised the problem of semantic interoperability across applications based on ...
144
click to vote
ICALP
2000
Springer
15 years 9 months ago
2000
Springer
Today many formalisms exist for specifying complex Markov chains. In contrast, formalism for specifying the quantitative properties to analyze have remained quite primitive. In th...
168
click to vote
ICDM
2009
IEEE
15 years 3 months ago
2009
IEEE
The design of a good kernel is fundamental for knowledge discovery from graph-structured data. Existing graph kernels exploit only limited information about the graph structures bu...