2774 search results - page 421 / 555 » Exploiting Deep Structure |
132
click to vote
CIKM
2004
Springer
15 years 10 months ago
2004
Springer
We examine the problem of retrieving the top-m ranked items from a large collection, randomly distributed across an n-node system. In order to retrieve the top m overall, we must ...
150
click to vote
ESA
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We obtain faster algorithms for problems such as rdimensional matching, r-set packing, graph packing, and graph edge packing when the size k of the solution is considered...
263
click to vote
EUSAI
2004
Springer
15 years 10 months ago
2004
Springer
Because of their severe resource-restrictions and limited user interfaces, smart everyday objects must often rely on remote resources to realize their services. This paper shows ho...
148
click to vote
GECCO
2004
Springer
15 years 10 months ago
2004
Springer
This paper describes a continuous estimation of distribution algorithm (EDA) to solve decomposable, real-valued optimization problems quickly, accurately, and reliably. This is the...
166
click to vote
IBERAMIA
2004
Springer
15 years 10 months ago
2004
Springer
In this paper we tackle the problem of providing a mobile robot with the ability to build a map of its environment using data gathered during navigation. The data correspond to the...