Sciweavers

1185 search results - page 133 / 237
» The Equivalence of Sampling and Searching
Sort
View
AAAI
2011
12 years 8 months ago
Optimal Rewards versus Leaf-Evaluation Heuristics in Planning Agents
Planning agents often lack the computational resources needed to build full planning trees for their environments. Agent designers commonly overcome this finite-horizon approxima...
Jonathan Sorg, Satinder P. Singh, Richard L. Lewis
JMM2
2006
212views more  JMM2 2006»
13 years 7 months ago
K-means Tracker: A General Algorithm for Tracking People
Abstract-- In this paper, we present a clustering-based tracking algorithm for tracking people (e.g. hand, head, eyeball, body, and lips). It is always a challenging task to track ...
Chunsheng Hua, Haiyuan Wu, Qian Chen, Toshikazu Wa...
SIGMOD
1996
ACM
132views Database» more  SIGMOD 1996»
14 years 2 days ago
Cost-Based Optimization for Magic: Algebra and Implementation
Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which diffe...
Praveen Seshadri, Joseph M. Hellerstein, Hamid Pir...
FUIN
2008
108views more  FUIN 2008»
13 years 6 months ago
Learning Ground CP-Logic Theories by Leveraging Bayesian Network Learning Techniques
Causal relations are present in many application domains. Causal Probabilistic Logic (CP-logic) is a probabilistic modeling language that is especially designed to express such rel...
Wannes Meert, Jan Struyf, Hendrik Blockeel
ICDE
1993
IEEE
158views Database» more  ICDE 1993»
14 years 1 days ago
Unification of Temporal Data Models
To add time su port to the relational model, both first normal form (fNF and non-INF appmches have maining within 1NF when time support is added may introduce data redundancy. The...
Christian S. Jensen, Michael D. Soo, Richard T. Sn...