1071 search results - page 191 / 215 » Theories of Automatic Structures and Their Complexity |
COLT
1993
Springer
14 years 4 days ago
1993
Springer
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...
CASC
2006
Springer
13 years 11 months ago
2006
Springer
We address various aspects of our computer algebra-based computer logic system redlog. There are numerous examples in the literature for successful applications of redlog to practi...
TASE
2008
IEEE
13 years 8 months ago
2008
IEEE
In this paper we deal with the problem of modeling railway networks with Petri nets so as to apply the theory of supervisory control for discrete event systems to automatically de...
DAC
2011
ACM
12 years 7 months ago
2011
ACM
Technology scaling allows the integration of billions of transistors on the same die but CAD tools struggle in keeping up with the increasing design complexity. Design productivit...
CADE
2005
Springer
14 years 8 months ago
2005
Springer
We present a fully proof-producing implementation of a quantifier elimination procedure for real closed fields. To our knowledge, this is the first generally useful proof-producing...