11740 search results - page 183 / 2348 » More Problems in Rewriting |
168
click to vote
NOMS
2006
IEEE
15 years 10 months ago
2006
IEEE
— Open Shortest Path First (OSPF) is a routing protocol which is widely used in the Industry. Its functionality mainly depends on the weights assigned to the links. Given the tra...
135
click to vote
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
156
click to vote
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
129
click to vote
CP
2001
Springer
15 years 9 months ago
2001
Springer
In recent years, many works have been carried out to solve over-constrained problems, and more speci cally the Maximal Constraint Satisfaction Problem (Max-CSP), where the goal is ...
129
click to vote
RTA
1998
Springer
15 years 8 months ago
1998
Springer
There is a close relationship between word unification and second-order unification. This similarity has been exploited for instance for proving decidability of monadic second-orde...