2566 search results - page 199 / 514 » The Online Median Problem |
182
click to vote
AAAI
2012
13 years 9 months ago
2012
We describe a new sound and complete method for compiling contingent planning problems with sensing actions into classical planning. Our method encodes conditional plans within a ...
162
click to vote
SDM
2007
SIAM
15 years 8 months ago
2007
SIAM
We propose the use of random projections with a sparse matrix to maintain a sketch of a collection of high-dimensional data-streams that are updated asynchronously. This sketch al...
164
click to vote
TSP
2010
15 years 1 months ago
2010
The problem of identification of quasi-periodically varying dynamic systems is considered. This problem can be solved using generalized adaptive notch filtering (GANF) algorithms. ...
182
click to vote
COCOA
2009
Springer
15 years 10 months ago
2009
Springer
stract to be announcedPlenary session 09:00-10:00 Panos M, Pardalos, University of Florida, USA Tea Break 10:00-10:20 At the 1st floor 10:20-10:45 Polynomial Approximation Schemes ...
171
click to vote
HIS
2008
15 years 8 months ago
2008
Artificial Neural Networks for online learning problems are often implemented with synaptic plasticity to achieve adaptive behaviour. A common problem is that the overall learning...