Sciweavers

1972 search results - page 369 / 395
» Evolutionary algorithms and dynamic programming
Sort
View
PVLDB
2008
126views more  PVLDB 2008»
15 years 2 months ago
Parallelizing query optimization
Many commercial RDBMSs employ cost-based query optimization exploiting dynamic programming (DP) to efficiently generate the optimal query execution plan. However, optimization tim...
Wook-Shin Han, Wooseong Kwak, Jinsoo Lee, Guy M. L...
SIGMOD
2008
ACM
111views Database» more  SIGMOD 2008»
16 years 2 months ago
Discovering bucket orders from full rankings
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
Jianlin Feng, Qiong Fang, Wilfred Ng
130
Voted
PODS
2004
ACM
148views Database» more  PODS 2004»
16 years 2 months ago
Deterministic Wavelet Thresholding for Maximum-Error Metrics
Several studies have demonstrated the effectiveness of the wavelet decomposition as a tool for reducing large amounts of data down to compact wavelet synopses that can be used to ...
Minos N. Garofalakis, Amit Kumar
136
Voted
ATAL
2008
Springer
15 years 4 months ago
Not all agents are equal: scaling up distributed POMDPs for agent networks
Many applications of networks of agents, including mobile sensor networks, unmanned air vehicles, autonomous underwater vehicles, involve 100s of agents acting collaboratively und...
Janusz Marecki, Tapana Gupta, Pradeep Varakantham,...
145
Voted
SIGMOD
2012
ACM
203views Database» more  SIGMOD 2012»
13 years 5 months ago
Optimizing index for taxonomy keyword search
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
Bolin Ding, Haixun Wang, Ruoming Jin, Jiawei Han, ...