2214 search results - page 391 / 443 » Complexity of Reasoning |
125
click to vote
CIKM
2010
Springer
15 years 1 months ago
2010
Springer
The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...
181
click to vote
ICDE
2012
IEEE
14 years 2 months ago
2012
IEEE
Top-k pairs queries have received significant attention by the research community. k-closest pairs queries, k-furthest pairs queries and their variants are among the most well stu...
148
Voted
MICRO
2005
IEEE
15 years 8 months ago
2005
IEEE
Scheduling algorithms used in compilers traditionally focus on goals such as reducing schedule length and register pressure or producing compact code. In the context of a hardware...
147
click to vote
VLDB
2005
ACM
15 years 8 months ago
2005
ACM
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...
121
click to vote
OOIS
1994
Springer
15 years 7 months ago
1994
Springer
The business of software development is solving problems. Following Polya, we can increase our ability to solve problems by focusing directly on problems themselves, on their part...