6608 search results - page 276 / 1322 » On the Completeness of Model Checking |
163
click to vote
CAV
1993
Springer
15 years 10 months ago
1993
Springer
Abstract. We describe the implementation, within ALDEBARAN of an algorithmic method allowing the generation of a minimal labeled transition rom an abstract model ; this minimality ...
173
click to vote
CVPR
1997
IEEE
16 years 8 months ago
1997
IEEE
We propose a new machine learning paradigm called Graph Transformer Networks that extends the applicability of gradient-based learning algorithms to systems composed of modules th...
156
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We conduct a computational analysis of partitions in additively separable hedonic games that satisfy standard criteria of fairness and optimality. We show that computing a partiti...
161
click to vote
RTCSA
1999
IEEE
15 years 10 months ago
1999
IEEE
Scheduling in an environment with constraints of many different types is known to be a hard problem. We tackle this problem for an integrated steel plant in Ghent, Belgium, using ...
187
click to vote
IANDC
2011
15 years 1 months ago
2011
Partial transition systems support abstract model checking of complex temporal propercombining both over- and under-approximatingabstractions into a single model. Over the years, ...