181 search results - page 10 / 37 » On Quantification with A Finite Universe |
125
click to vote
JCT
2008
15 years 6 months ago
2008
Let be the fundamental group of a finite connected graph G. Let M be an abelian group. A distribution on the boundary of the universal covering tree is an M-valued measure defin...
158
click to vote
JUCS
2002
15 years 5 months ago
2002
: The problem about the synchronization of a finite deterministic automaton is not yet properly understood. The present paper investigates this and related problems within the gene...
142
click to vote
AAAI
1993
15 years 7 months ago
1993
The Rete and Treat algorithms are considered the most efficient implementation techniques for Forward Chaining rule systems. These algorithms support a language of limited express...
175
click to vote
JSYML
2010
15 years 23 days ago
2010
We prove that any countable index, universally measurable subgroup of a Polish group is open. By consequence, any universally measurable homomorphism from a Polish group into the i...
160
click to vote
AUTOMATICA
2006
15 years 6 months ago
2006
Design of iterative learning control (ILC) often requires some prior knowledge about a system's control matrix. In some applications, such as uncalibrated visual servoing, th...