607 search results - page 43 / 122 » Unifying Exact Completions |
115
click to vote
DATE
2003
IEEE
15 years 11 months ago
2003
IEEE
Given a plant Å and a specification Å , the largest solution of the FSM equation Å ¯ Å Å contains all possible discrete controllers Å . Often we are interested in computin...
128
click to vote
JCT
2007
15 years 6 months ago
2007
Let the k-graph Fank consist of k edges that pairwise intersect exactly in one vertex x, plus one more edge intersecting each of these edges in a vertex different from x. We prov...
161
click to vote
SISAP
2008
IEEE
16 years 17 days ago
2008
IEEE
In this article, we review the major paradigms for approximate similarity queries and propose a classification schema that easily allows existing approaches to be compared along ...
169
click to vote
ECOOP
2007
Springer
16 years 11 days ago
2007
Springer
Service Oriented Architecture (SOA) promotes the utilization of available services to develop completely new applications in a context which has not been foreseen as these services...
170
click to vote
SFM
2007
Springer
16 years 9 days ago
2007
Springer
Markovian behavioral equivalences are a means to relate and manipulate the formal descriptions of systems with an underlying CTMC semantics. There are three fundamental approaches ...