3378 search results - page 92 / 676 » A universe of binding and computation |
103
click to vote
CAV
2006
Springer
15 years 1 months ago
2006
Springer
We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the standard algorithm, which uses the subset construction...
PATAT
1995
Springer
15 years 1 months ago
1995
Springer
The scheduling of exams in institutions of higher education is known to be a highly constrained problem. The advent of modularity in many institutions in the UK has resulted in a s...
LISA
2007
15 years 5 days ago
2007
We report on and discuss our experiences with teaching Network and System Administration at the level of Masters at Oslo University College and the University of Amsterdam. At our...
DCC
2004
IEEE
15 years 9 months ago
2004
IEEE
In the discrete filtering problem, a data sequence over a finite alphabet is assumed to be corrupted by a discrete memoryless channel. The goal is to reconstruct the clean sequenc...
ECAL
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. Self-replication is a fundamental property of many interesting physical, formal and biological systems, such as crystals, waves, automata, and especially forms of natural...