5580 search results - page 765 / 1116 » Randomized priority algorithms |
174
click to vote
EVOW
2007
Springer
16 years 28 days ago
2007
Springer
The Shortest Common Supersequence Problem (SCSP) is a well-known hard combinatorial optimization problem that formalizes many real world problems. This paper presents a novel rando...
193
click to vote
FCT
2007
Springer
16 years 28 days ago
2007
Springer
We present quantum query complexity bounds for testing algebraic properties. For a set S and a binary operation on S, we consider the decision problem whether S is a semigroup or ...
176
click to vote
ICCS
2007
Springer
16 years 28 days ago
2007
Springer
In this paper, active learning with support vector machines (SVMs) is applied to the problem of tornado prediction. This method is used to predict which storm-scale circulations yi...
140
click to vote
ISICA
2007
Springer
16 years 28 days ago
2007
Springer
Abstract. MOEA/D is a novel and successful Multi-Objective Evolutionary Algorithms(MOEA) which utilizes the idea of problem decomposition to tackle the complexity from multiple obj...
189
click to vote
ISSAC
2007
Springer
16 years 28 days ago
2007
Springer
We describe some major recent progress in exact and symbolic linear algebra. These advances concern the improvement of complexity estimates for fundamental problems such as linear...