2981 search results - page 162 / 597 » Answer Set Planning |
148
Voted
SIGMOD
2000
ACM
15 years 8 months ago
2000
ACM
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...
SIGMOD
2002
ACM
16 years 3 months ago
2002
ACM
Relational query optimizers have traditionally relied upon table cardinalities when estimating the cost of the query plans they consider. While this approach has been and continue...
152
Voted
JUCS
2008
15 years 3 months ago
2008
Abstract: Information integration applications combine data from heterogeneous sources to assist the user in solving repetitive data-intensive tasks. Currently, such applications r...
115
Voted
WOLLIC
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We present a domain-independent algorithm for planning that computes macros in a novel way. Our algorithm computes macros “on-the-fly” for a given set of states and ...
117
Voted
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
Let B be a set of n unit balls in R3 . We show that the combinatorial complexity of the space of lines in R3 that avoid all the balls of B is O(n3+ε ), for any ε > 0. This re...