5115 search results - page 673 / 1023 » On Randomized Lanczos Algorithms |
177
click to vote
CSCLP
2007
Springer
16 years 23 days ago
2007
Springer
We formulate a problem of goal satisfaction in mutex networks in this paper. The proposed problem is motivated by problems that arise in concurrent planning. For more efficient sol...
171
click to vote
EVOW
2007
Springer
16 years 23 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...
186
click to vote
FCT
2007
Springer
16 years 23 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 ...
173
click to vote
ICCS
2007
Springer
16 years 23 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...
138
click to vote
ISICA
2007
Springer
16 years 22 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...