Sciweavers

6693 search results - page 32 / 1339
» On an anytime algorithm for control
Sort
View
KDD
2003
ACM
146views Data Mining» more  KDD 2003»
14 years 9 months ago
Probabilistic discovery of time series motifs
Several important time series data mining problems reduce to the core task of finding approximately repeated subsequences in a longer time series. In an earlier work, we formalize...
Bill Yuan-chi Chiu, Eamonn J. Keogh, Stefano Lonar...
KDD
2002
ACM
171views Data Mining» more  KDD 2002»
14 years 9 months ago
Mining complex models from arbitrarily large databases in constant time
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
Geoff Hulten, Pedro Domingos
KR
2004
Springer
14 years 2 months ago
An Improved Integer Local Search for Complex Scheduling Problems
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
Weixiong Zhang, Xiaotao Zhang
CDC
2009
IEEE
164views Control Systems» more  CDC 2009»
14 years 13 days ago
Spectral Multiscale Coverage: A uniform coverage algorithm for mobile sensor networks
Abstract— In this paper we propose centralized feedback control laws for mobile sensor networks so that sensor trajectories cover a given domain as uniformly as possible. The des...
George Mathew, Igor Mezic
AAAI
2008
13 years 11 months ago
Towards Faster Planning with Continuous Resources in Stochastic Domains
Agents often have to construct plans that obey resource limits for continuous resources whose consumption can only be characterized by probability distributions. While Markov Deci...
Janusz Marecki, Milind Tambe