14699 search results - page 346 / 2940 » Complexity and Cognitive Computing |
ICCS
2004
Springer
15 years 10 months ago
2004
Springer
We present a formalism that is able to cope with search and congestion simultaneously. This formalism avoids the problem of simulating the dynamics of the search-communication proc...
124
click to vote
IWPEC
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We introduce a general notion of miniaturization of a problem that comprises the different miniaturizations of concrete problems considered so far. We develop parts of t...
158
click to vote
IPPS
1999
IEEE
15 years 9 months ago
1999
IEEE
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
152
click to vote
SIGGRAPH
1996
ACM
15 years 8 months ago
1996
ACM
A number of techniques have been developed for reconstructing surfaces by integrating groups of aligned range images. A desirable set of properties for such algorithms includes: i...
125
Voted
DAGSTUHL
2006
15 years 6 months ago
2006
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true dis...