Sciweavers

4378 search results - page 596 / 876
» On the Complexity of Ordered Colourings
Sort
View
ICDT
2001
ACM
131views Database» more  ICDT 2001»
15 years 11 months ago
Query Evaluation via Tree-Decompositions
A number of efficient methods for evaluating first-order and monadic-second order queries on finite relational structures are based on tree-decompositions of structures or quer...
Jörg Flum, Markus Frick, Martin Grohe
ICSE
2001
IEEE-ACM
15 years 11 months ago
A Scalable Formal Method for Design and Automatic Checking of User Interfaces
The paper addresses the formal specification, design and implementation of the behavioral component of graphical user interfaces. The complex sequences of visual events and action...
Jean Berstel, Stefano Crespi-Reghizzi, Gilles Rous...
ICSE
2001
IEEE-ACM
15 years 11 months ago
Fast Formal Analysis of Requirements via "Topoi Diagrams"
Early testing of requirements can decrease the cost of removing errors in software projects. However, unless done carefully, that testing process can significantly add to the cos...
Tim Menzies, John D. Powell, Michael E. Houle
IFIP
2001
Springer
15 years 11 months ago
Semiotics and Intelligent Control
The overall purpose of this paper is to demonstrate the relevance of semiotics concepts to the analysis of intelligent control systems. Semiotics has only a minor impact on resear...
Morten Lind
ISSAC
2001
Springer
123views Mathematics» more  ISSAC 2001»
15 years 11 months ago
A probabilistic algorithm to test local algebraic observability in polynomial time
The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the inp...
Alexandre Sedoglavic