2780 search results - page 40 / 556 » Generalizing by Removing Detail |
118
click to vote
SAT
2004
Springer
15 years 9 months ago
2004
Springer
Kolaitis and Vardi pointed out that constraint satisfaction and conjunctive query containment are essentially the same problem. We study the Boolean conjunctive queries under a mor...
104
click to vote
IWPC
2003
IEEE
15 years 9 months ago
2003
IEEE
Increasingly focus in the software comprehension community is shifting from representing the results of analysis in the graph and database domain to reflecting insights directly i...
147
Voted
GCC
2006
Springer
15 years 7 months ago
2006
Springer
Legacy program execution system, which is necessary for Grid to enable users to reuse all legacy programs without reengineering source codes, is still an open problem. We propose ...
196
click to vote
AAAI
2008
15 years 6 months ago
2008
Many existing explanation methods in Bayesian networks, such as Maximum a Posteriori (MAP) assignment and Most Probable Explanation (MPE), generate complete assignments for target...
146
click to vote
DM
2007
15 years 4 months ago
2007
Switch-setting games like Lights Out are typically modelled as a graph, where the vertices represent switches and lamps, and the edges capture the switching rules. We generalize t...