1484 search results - page 54 / 297 » Ants meeting algorithms |
STOC
2003
ACM
14 years 10 months ago
2003
ACM
CORR
2011
Springer
13 years 4 months ago
2011
Springer
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can ...
NIPS
1998
13 years 11 months ago
1998
Lazy learning is a memory-based technique that, once a query is received, extracts a prediction interpolating locally the neighboring examples of the query which are considered re...
ICDE
2002
IEEE
14 years 11 months ago
2002
IEEE
Network, web, and disk I/O traffic are usually bursty, self-similar [9, 3, 5, 6] and therefore can not be modeled adequately with Poisson arrivals[9]. However, we do want to model...
PC
2006
13 years 10 months ago
2006
In this work, we discuss an extension of the set of principles that should guide the future design and development of skeletal programming systems, as defined by Cole in his ``pra...