674 search results - page 53 / 135 » The computational complexity of the parallel knock-out probl... |
107
click to vote
PPSN
1992
Springer
15 years 5 months ago
1992
Springer
The limitations of linear chromosomes and conventional recombination operators are reviewed. It is argued that there are at least three classes of problems for which such represen...
147
click to vote
FCCM
2008
IEEE
15 years 7 months ago
2008
IEEE
The map-reduce model requires users to express their problem in terms of a map function that processes single records in a stream, and a reduce function that merges all mapped out...
118
click to vote
PODS
2006
ACM
16 years 1 months ago
2006
ACM
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
CLUSTER
2004
IEEE
15 years 5 months ago
2004
IEEE
The complexity and cost of isolating the root cause of system problems in large parallel computers generally scales with the size of the system. Syslog messages provide a primary ...
106
click to vote
LATIN
2010
Springer
14 years 12 months ago
2010
Springer
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...