1002 search results - page 82 / 201 » Towards Graph Programs for Graph Algorithms |
110
click to vote
AAAI
2006
15 years 3 months ago
2006
Real-time dynamic programming (RTDP) is a heuristic search algorithm for solving MDPs. We present a modified algorithm called Focused RTDP with several improvements. While RTDP ma...
105
click to vote
ICDAR
2003
IEEE
15 years 7 months ago
2003
IEEE
This paper describes a complete system for reading typewritten lexicon words in noisy images - in this case museum index cards. The system is conceptually simple, and straightforw...
117
click to vote
SCAM
2003
IEEE
15 years 7 months ago
2003
IEEE
Many static analyses aim at assigning to each control point of a program an invariant property that characterizes any state of a trace corresponding to this point. The choice of t...
156
click to vote
TRIER
2002
15 years 2 months ago
2002
Constant propagation aims at identifying expressions that always yield a unique constant value at run-time. It is well-known that constant propagation is undecidable for programs w...
101
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...