14165 search results - page 232 / 2833 » The generalized two-server problem |
152
Voted
FROCOS
2007
Springer
15 years 11 months ago
2007
Springer
In abstract algebra, a structure is said to be Noetherian if it does not admit infinite strictly ascending chains of congruences. In this paper, we adapt this notion to first-ord...
121
click to vote
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
In this paper, we provide an algorithm that systematically considers all small trees in the search space of genetic programming. These small trees are used to generate useful subr...
162
click to vote
ICA
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. This paper presents a new algorithm for solving the permutation ambiguity in convolutive blind source separation. When transformed to the frequency domain, the source sep...
139
click to vote
ISAAC
2007
Springer
15 years 11 months ago
2007
Springer
We design a faster algorithm for the k-maximum sub-array problem under the conventional RAM model, based on distance matrix multiplication (DMM). Specifically we achieve O(n3 log ...
111
Voted
LICS
2006
IEEE
15 years 11 months ago
2006
IEEE
Abstract. We describe simple algebraic and combinatorial characterisations of finite relational core structures admitting finitely many obstructions. As a consequence, we show th...