Sciweavers

1070 search results - page 207 / 214
» Benchmarking Adaptive Indexing
Sort
View
BIRTHDAY
2005
Springer
15 years 3 months ago
Planning in Answer Set Programming using Ordered Task Decomposition
abstract. In this paper we investigate a formalism for solving planning problems based on ordered task decomposition using Answer Set Programming (ASP). Our planning methodology is...
Jürgen Dix, Ugur Kuter, Dana S. Nau
CP
2005
Springer
15 years 3 months ago
Neighbourhood Clause Weight Redistribution in Local Search for SAT
Abstract. In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability proble...
Abdelraouf Ishtaiwi, John Thornton, Abdul Sattar, ...
KDD
2005
ACM
147views Data Mining» more  KDD 2005»
15 years 3 months ago
Combining proactive and reactive predictions for data streams
Mining data streams is important in both science and commerce. Two major challenges are (1) the data may grow without limit so that it is difficult to retain a long history; and (...
Ying Yang, Xindong Wu, Xingquan Zhu
VLDB
2005
ACM
139views Database» more  VLDB 2005»
15 years 3 months ago
Statistical Learning Techniques for Costing XML Queries
Developing cost models for query optimization is significantly harder for XML queries than for traditional relational queries. The reason is that XML query operators are much mor...
Ning Zhang 0002, Peter J. Haas, Vanja Josifovski, ...
IWMM
2004
Springer
98views Hardware» more  IWMM 2004»
15 years 3 months ago
Dynamic object sampling for pretenuring
Many state-of-the-art garbage collectors are generational, collecting the young nursery objects more frequently than old objects. These collectors perform well because young objec...
Maria Jump, Stephen M. Blackburn, Kathryn S. McKin...