1208 search results - page 8 / 242 » Uniform eventown problems |
98
Voted
STACS
2004
Springer
15 years 7 months ago
2004
Springer
We consider the problem of preemptive scheduling on uniformly related machines. We present a semi-online algorithm which, if the optimal makespan is given in advance, produces an ...
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
A commonly experienced problem with population based optimisation methods is the gradual decline in population diversity that tends to occur over time. This can slow a system’s ...
141
Voted
TC
2002
15 years 1 months ago
2002
We investigate whether asynchronous computational models and asynchronous algorithms can be considered for designing real-time distributed fault-tolerant systems. A priori, the lac...
112
click to vote
CJTCS
1999
15 years 1 months ago
1999
We show that thepermanent cannot be computed by uniform constantdepth threshold circuits of size Tn, for any function T such that for all k, Tk n = o2n. More generally, we show th...
ALT
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. Blum and Blum (1975) showed that a class B of suitable recursive approximations to the halting problem is reliably EX-learnable. These investigations are carried on by sh...