1092 search results - page 170 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
189
click to vote
DAM
1999
15 years 5 months ago
1999
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
144
click to vote
TCS
2002
15 years 5 months ago
2002
The chords' problem is a variant of an old problem of computational geometry: given a set of points of n , one can easily build the multiset of the distances between the poi...
186
click to vote
ICALP
2011
Springer
14 years 9 months ago
2011
Springer
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
231
click to vote
GECCO
2011
Springer
14 years 9 months ago
2011
Springer
In continuous optimisation, surrogate models (SMs) are used when tackling real-world problems whose candidate solutions are expensive to evaluate. In previous work, we showed that...
155
click to vote
ICLP
2005
Springer
15 years 11 months ago
2005
Springer
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...