Sciweavers

2020 search results - page 85 / 404
» KDD Process Planning
Sort
View
AI
2011
Springer
14 years 1 months ago
Decentralized MDPs with sparse interactions
In this work, we explore how local interactions can simplify the process of decision-making in multiagent systems, particularly in multirobot problems. We review a recent decision-...
Francisco S. Melo, Manuela M. Veloso
SIGMOD
2000
ACM
141views Database» more  SIGMOD 2000»
15 years 2 months ago
Counting, Enumerating, and Sampling of Execution Plans in a Cost-Based Query Optimizer
Testing an SQL database system by running large sets of deterministic or stochastic SQL statements is common practice in commercial database development. However, code defects oft...
Florian Waas, César A. Galindo-Legaria
EDBT
2010
ACM
125views Database» more  EDBT 2010»
15 years 1 months ago
A plan for OLAP
So far, data warehousing has often been discussed in the light of complex OLAP queries and as reporting facility for operative data. We argue that business planning as a means to ...
Bernhard Jaecksch, Wolfgang Lehner, Franz Faerber
JAIR
2010
131views more  JAIR 2010»
14 years 8 months ago
Automatic Induction of Bellman-Error Features for Probabilistic Planning
Domain-specific features are important in representing problem structure throughout machine learning and decision-theoretic planning. In planning, once state features are provide...
Jia-Hong Wu, Robert Givan
SIGMOD
2006
ACM
232views Database» more  SIGMOD 2006»
15 years 10 months ago
To search or to crawl?: towards a query optimizer for text-centric tasks
Text is ubiquitous and, not surprisingly, many important applications rely on textual data for a variety of tasks. As a notable example, information extraction applications derive...
Panagiotis G. Ipeirotis, Eugene Agichtein, Pranay ...