297 search results - page 3 / 60 » Polynomial heuristics for query optimization |
DEXA
1998
Springer
13 years 10 months ago
1998
Springer
AIPS
2000
13 years 7 months ago
2000
hsp and hspr are two recent planners that search the state-space using an heuristic function extracted from Strips encodings. hsp does a forward search from the initial state reco...
ADMA
2005
Springer
13 years 12 months ago
2005
Springer
Execution cost of batched data mining queries can be reduced by integrating their I/O steps. Due to memory limitations, not all data mining queries in a batch can be executed toget...
FCT
2007
Springer
13 years 10 months ago
2007
Springer
We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
OL
2011
13 years 1 months ago
2011
We demonstrate that the Linear Multidimensional Assignment Problem with iid random costs is polynomially "-approximable almost surely (a. s.) via a simple greedy heuristic, f...