672 search results - page 2 / 135 » A General Solution to the Graph History Interaction Problem |
ESA
2003
Springer
13 years 11 months ago
2003
Springer
Let G = (V, E) be an undirected graph, with three numbers d0(e) ≥ d1(e) ≥ d2(e) ≥ 0 for each edge e ∈ E. A solution is a subset U ⊆ V and di(e) represents the cost contr...
ISLPED
2003
ACM
13 years 11 months ago
2003
ACM
This paper proposes two very fast graph theoretic heuristics for the low power binding problem given fixed number of resources and multiple architectures for the resources. First...
LICS
2012
IEEE
11 years 8 months ago
2012
IEEE
Abstract—We investigate some basic questions about the interaction of regular and rational relations on words. The primary motivation comes from the study of logics for querying ...
SOFSEM
2007
Springer
13 years 11 months ago
2007
Springer
We study two aspects of a generalization of the Tower of Hanoi puzzle. In 1981, D. Wood suggested its variant, where a bigger disk may be placed higher than a smaller one if their ...
MFCS
2009
Springer
14 years 5 days ago
2009
Springer
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving...