Sciweavers

640 search results - page 33 / 128
» Discovering State Invariants
Sort
View
IFM
2009
Springer
155views Formal Methods» more  IFM 2009»
13 years 8 months ago
Application of Graph Transformation in Verification of Dynamic Systems
Abstract. A communication system evolves dynamically with the addition and deletion of services. In our previous work [12], a graph transformation system (GTS) was used to model th...
Zarrin Langari, Richard J. Trefler
ATAL
2000
Springer
14 years 3 months ago
Optimistic and Disjunctive Agent Design Problems
Abstract. The agent design problem is as follows: Given an environment, together with a specification of a task, is it possible to construct an agent that will guarantee to succes...
Michael Wooldridge, Paul E. Dunne
NAACL
2004
14 years 10 days ago
Automatically Labeling Semantic Classes
Systems that automatically discover semantic classes have emerged in part to address the limitations of broad-coverage lexical resources such as WordNet and Cyc. The current state...
Patrick Pantel, Deepak Ravichandran
ICCV
2007
IEEE
15 years 27 days ago
An Invariant Large Margin Nearest Neighbour Classifier
The k-nearest neighbour (kNN) rule is a simple and effective method for multi-way classification that is much used in Computer Vision. However, its performance depends heavily on ...
M. Pawan Kumar, Philip H. S. Torr, Andrew Zisserma...
FOSSACS
2010
Springer
14 years 5 months ago
Coalgebraic Correspondence Theory
Abstract. We lay the foundations of a first-order correspondence theory for coalgebraic logics that makes the transition structure explicit in the first-order modelling. In parti...
Lutz Schröder, Dirk Pattinson