Sciweavers

4128 search results - page 660 / 826
» Learning and using relational theories
Sort
View
HYBRID
2010
Springer
15 years 5 months ago
Compositional analysis for linear control systems
The complexity of physical and engineering systems, both in terms of the governing physical phenomena and the number of subprocesses involved, is mirrored in ever more complex mat...
Florian Kerber, Arjan van der Schaft
COCO
2005
Springer
150views Algorithms» more  COCO 2005»
15 years 3 months ago
The Quantum Adversary Method and Classical Formula Size Lower Bounds
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
Sophie Laplante, Troy Lee, Mario Szegedy
PODS
2010
ACM
242views Database» more  PODS 2010»
15 years 3 months ago
Certain answers for XML queries
The notion of certain answers arises when one queries incompletely specified databases, e.g., in data integration and exchange scenarios, or databases with missing information. W...
Claire David, Leonid Libkin, Filip Murlak
CORR
2006
Springer
108views Education» more  CORR 2006»
14 years 10 months ago
Two polygraphic presentations of Petri nets
: This document gives an algebraic and two polygraphic translations of Petri nets, all three providing an easier way to describe reductions and to identify some of them. The first ...
Yves Guiraud
SIGSOFT
2009
ACM
15 years 11 months ago
Automatic steering of behavioral model inference
Many testing and analysis techniques use finite state models to validate and verify the quality of software systems. Since the specification of such models is complex and timecons...
David Lo, Leonardo Mariani, Mauro Pezzè