1382 search results - page 5 / 277 » Term ordering problem on MDG |
RTA
2010
Springer
15 years 1 months ago
2010
Springer
For the whole class of linear term rewriting systems and for each integer k, we define k-bounded rewriting as a restriction of the usual notion of rewriting. We show that the k-bo...
JGO
2010
14 years 4 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
60
Voted
TFS
2008
14 years 9 months ago
2008
Many real problems dealing with qualitative aspects use linguistic approaches to assess such aspects. In most of these problems, a uniform and symmetrical distribution of the lingu...
RTA
2000
Springer
15 years 1 months ago
2000
Springer
We consider the problem of higher-order matching restricted et of linear -terms (i.e., -terms where each abstraction x. M is such that there is exactly one free occurrence of x in ...
GROUP
2005
ACM
15 years 3 months ago
2005
ACM
A common problem in chat is that the chat display only reveals the temporal order of the conversation. A better user interface is desired that reveals the logical order of the mes...