1092 search results - page 99 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
170
click to vote
EPIA
1993
Springer
15 years 10 months ago
1993
Springer
Abstract. This work presents a constraint solver for the domain of rational trees. Since the problem is NP-hard the strategy used by the solver is to reduce as much as possible, in...
139
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
In this paper, we give a polynomial (O(n8)) algorithm for finding a longest common pattern between two permutations of size n given that one is separable. We also give an algorithm...
137
Voted
MOBIHOC
2008
ACM
16 years 5 months ago
2008
ACM
Recently, cooperative communications, in the form of keeping each node with a single antenna and having a node exploit a relay node's antenna, is shown to be a promising appr...
160
click to vote
NCA
2006
IEEE
15 years 6 months ago
2006
IEEE
The goal of this paper is to design a new control algorithm for open-loop control of complex systems. This control approach is based on a genealogical decision tree for both regula...
165
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We consider the question of the stability of evolutionary algorithms to gradual changes, or drift, in the target concept. We define an algorithm to be resistant to drift if, for s...