903 search results - page 153 / 181 » Non-well-founded trees in categories |
SAC
2005
ACM
15 years 7 months ago
2005
ACM
In this paper, we propose an extension of three incomplete depthfirst search techniques, namely depth-bounded backtrack search, credit search, and iterative broadening, towards pr...
119
click to vote
SAC
2005
ACM
15 years 7 months ago
2005
ACM
During language evolution, compiler construction is usually d along two dimensions: defining new abstract syntax tree (AST) classes, or adding new operations. In order to facilita...
104
click to vote
SI3D
2005
ACM
15 years 7 months ago
2005
ACM
The broad-phase step of collision detection in scenes composed of n moving objects is a challenging problem because enumerating collision pairs has an inherent O(n2) complexity. S...
113
Voted
SIGCOMM
2005
ACM
15 years 7 months ago
2005
ACM
Recent research has shown that one can use Distributed Hash Tables (DHTs) to build scalable, robust and efficient applications. One question that is often left unanswered is that ...
141
click to vote
WCFLP
2005
ACM
15 years 7 months ago
2005
ACM
Debugging is one of the essential parts of the software development cycle. However, the usual debugging techniques used in imperative languages such as the step by step execution ...