3455 search results - page 303 / 691 » Generalized Game Trees |
130
click to vote
ISAAC
2005
Springer
16 years 6 days ago
2005
Springer
We consider generalizations of the k-source sum of vertex eccentricity problem (k-SVET) and the k-source sum of source eccentricity problem (k-SSET) [1], which we call SDET and SSE...
209
click to vote
RTA
2005
Springer
16 years 5 days ago
2005
Springer
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
169
click to vote
ICALP
2001
Springer
15 years 11 months ago
2001
Springer
Given an undirected graph with positive edge weights, define Nq(v) for each node v to be the set of q nodes closest to v (including v itself and breaking ties by node ID). It is ...
161
click to vote
SAS
2001
Springer
15 years 11 months ago
2001
Springer
This paper describes the precise speci cation, design, analysis, implementation, and measurements of an e cient algorithm for solving regular tree grammar based constraints. The p...
176
click to vote
ESOP
2009
Springer
15 years 10 months ago
2009
Springer
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...