34 search results - page 6 / 7 » On the Finiteness of the Recursive Chromatic Number |
100
click to vote
NC
2008
14 years 11 months ago
2008
We consider spiking neural P systems with rules allowed to introduce zero, one, or more spikes at the same time. The motivation comes both from constructing small universal systems...
KR
1992
Springer
15 years 3 months ago
1992
Springer
In this paper, we view planning as a special case of reasoning about indefinite actions. We treat actions as predicates defined over a linear temporal order. This formalism permit...
106
click to vote
AAMAS
2000
Springer
14 years 11 months ago
2000
Springer
We adopt the decision-theoretic principle of expected utility maximization as a paradigm for designing autonomous rational agents, and present a framework that uses this paradigm t...
98
Voted
LICS
1996
IEEE
15 years 3 months ago
1996
IEEE
Real PCF is an extension of the programming language PCF with a data type for real numbers. Although a Real PCF definable real number cannot be computed in finitely many steps, it...
82
Voted
FUIN
2008
14 years 11 months ago
2008
This paper is concerned with the universality problem for timed automata: given a timed automaton A, does A accept all timed words? Alur and Dill have shown that the universality p...