Sciweavers

174 search results - page 34 / 35
» The Moving Target Function Problem in Multi-Agent Learning
Sort
View
JMLR
2002
137views more  JMLR 2002»
13 years 7 months ago
The Subspace Information Criterion for Infinite Dimensional Hypothesis Spaces
A central problem in learning is selection of an appropriate model. This is typically done by estimating the unknown generalization errors of a set of models to be selected from a...
Masashi Sugiyama, Klaus-Robert Müller
CGO
2004
IEEE
13 years 11 months ago
A Dynamically Tuned Sorting Library
Empirical search is a strategy used during the installation of library generators such as ATLAS, FFTW, and SPIRAL to identify the algorithm or the version of an algorithm that del...
Xiaoming Li, María Jesús Garzar&aacu...
SIGCOMM
1991
ACM
13 years 11 months ago
IP-Based Protocols for Mobile Internetworking
We consider the problem of providing network access to hosts whose physical location changes with time. Such hosts cannot depend on traditional forms of network connectivity and r...
John Ioannidis, Dan Duchamp, Gerald Q. Maguire Jr.
ICRA
2010
IEEE
143views Robotics» more  ICRA 2010»
13 years 5 months ago
On the influence of ship motion prediction accuracy on motion planning and control of robotic manipulators on seaborne platforms
Robotic manipulators on non-inertial platforms, such as ships, have to endure large inertial forces due to the non-inertial motion of the platform. When the non-inertial platform&#...
Pål Johan From, Jan Tommy Gravdahl, Pieter A...
ICCV
2009
IEEE
15 years 18 days ago
Efficient subset selection based on the Renyi entropy
Many machine learning algorithms require the summation of Gaussian kernel functions, an expensive operation if implemented straightforwardly. Several methods have been proposed t...
Vlad I. Morariu1, Balaji V. Srinivasan, Vikas C. R...