5171 search results - page 205 / 1035 » Deterministic Parallel Processing |
123
Voted
WIA
2009
Springer
15 years 6 months ago
2009
Springer
In this paper we consider the problem of minimization of deterministic finite automata (DFA) with reference to Hopcroft’s algorithm. Hopcroft’s algorithm has several degrees o...
120
click to vote
NLPRS
2001
Springer
15 years 6 months ago
2001
Springer
There are two different approaches in the LR parsing. The first one is the deterministic approach that performs the only one action using the control rules learned without any LR ...
DC
2008
15 years 2 months ago
2008
The power of an object type T can be measured as the maximum number n of processes that can solve consensus using only objects of T and registers. This number, denoted cons(T), is ...
CPC
2006
15 years 2 months ago
2006
Abstract. Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deter...
110
click to vote
IPL
2008
15 years 2 months ago
2008
We consider the online problem of scheduling jobs with equal processing times on a single machine. Each job has a release time and a deadline, and the goal is to maximize the numb...