4131 search results - page 431 / 827 » Compactness in Topology and Computation |
218
click to vote
RTA
2005
Springer
16 years 11 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...
190
click to vote
VLSM
2005
Springer
16 years 11 days ago
2005
Springer
While methods based on partial differential equations (PDEs) and variational techniques are powerful tools for denoising and inpainting digital images, their use for image compress...
188
click to vote
ATAL
2004
Springer
16 years 8 days ago
2004
Springer
In order to succeed, agents playing games must reason about the mechanics of the game, the strategies of other agents, other agents’ reasoning about their strategies, and the ra...
236
click to vote
SPIN
2004
Springer
16 years 7 days ago
2004
Springer
Most approaches for model checking software are based on ration of abstract models from source code, which may greatly reduce the search space, but may also introduce errors that a...
158
click to vote
WG
2004
Springer
16 years 6 days ago
2004
Springer
In this paper we study collective additive tree spanners for families of graphs that either contain or are contained in AT-free graphs. We say that a graph G = (V, E) admits a sys...