Sciweavers

466 search results - page 86 / 94
» Preprocessing Search Spaces for Branch and Bound Search
Sort
View
ATAL
2009
Springer
15 years 4 months ago
Planning with continuous resources for agent teams
Many problems of multiagent planning under uncertainty require distributed reasoning with continuous resources and resource limits. Decentralized Markov Decision Problems (Dec-MDP...
Janusz Marecki, Milind Tambe
PVLDB
2008
82views more  PVLDB 2008»
14 years 9 months ago
Mining non-redundant high order correlations in binary data
Many approaches have been proposed to find correlations in binary data. Usually, these methods focus on pair-wise correlations. In biology applications, it is important to find co...
Xiang Zhang, Feng Pan, Wei Wang 0010, Andrew B. No...
GIS
2005
ACM
15 years 10 months ago
Two ellipse-based pruning methods for group nearest neighbor queries
Group nearest neighbor (GNN) queries are a relatively new type of operations in spatial database applications. Different from a traditional kNN query which specifies a single quer...
Hongga Li, Hua Lu, Bo Huang, Zhiyong Huang
186
Voted
VLDB
2006
ACM
190views Database» more  VLDB 2006»
15 years 9 months ago
Online summarization of dynamic time series data
Managing large-scale time series databases has attracted significant attention in the database community recently. Related fundamental problems such as dimensionality reduction, tr...
Ümit Y. Ogras, Hakan Ferhatosmanoglu
PKDD
2009
Springer
137views Data Mining» more  PKDD 2009»
15 years 4 months ago
On Subgroup Discovery in Numerical Domains
Subgroup discovery is a Knowledge Discovery task that aims at finding subgroups of a population with high generality and distributional unusualness. While several subgroup discove...
Henrik Grosskreutz, Stefan Rüping