648 search results - page 36 / 130 » Using Criticalities as a Heuristic for Answer Set Programmin... |
123
click to vote
JAIR
2007
15 years 1 months ago
2007
This work is a contribution to prioritized reasoning in logic programming in the presence of preference relations involving atoms. The technique, providing a new interpretation fo...
190
click to vote
ICDE
2008
IEEE
16 years 2 months ago
2008
IEEE
We study the problem of answering XPATH queries using multiple materialized views. Despite the efforts on answering queries using single materialized view, answering queries using ...
126
click to vote
JCO
1998
15 years 1 months ago
1998
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
124
click to vote
PLDI
2003
ACM
15 years 6 months ago
2003
ACM
Compiler writers have crafted many heuristics over the years to approximately solve NP-hard problems efficiently. Finding a heuristic that performs well on a broad range of applic...
116
click to vote
WWW
2006
ACM
16 years 2 months ago
2006
ACM
Major search engines currently use the history of a user's actions (e.g., queries, clicks) to personalize search results. In this paper, we present a new personalized service...