1096 search results - page 59 / 220 » A New Approach for Speeding Up Enumeration Algorithms |
PLDI
1994
ACM
15 years 3 months ago
1994
ACM
In this paper, we describe the program structure tree (PST), a hierarchical representation of program structure based on single entry single exit (SESE) regions of the control flo...
OOPSLA
2010
Springer
14 years 10 months ago
2010
Springer
Inclusion-based points-to analysis provides a good trade-off between precision of results and speed of analysis, and it has been incorporated into several production compilers inc...
124
click to vote
IJCAI
2007
15 years 1 months ago
2007
This work presents a new algorithm, called Heuristically Accelerated Minimax-Q (HAMMQ), that allows the use of heuristics to speed up the wellknown Multiagent Reinforcement Learni...
104
click to vote
ATAL
2006
Springer
15 years 3 months ago
2006
Springer
Factored representations, model-based learning, and hierarchies are well-studied techniques for improving the learning efficiency of reinforcement-learning algorithms in large-sca...
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
Failure detectors represent a very important building block in distributed applications. The speed and the accuracy of the failure detectors is critical to the performance of the ...