5153 search results - page 681 / 1031 » Introduction to Randomized Algorithms |
154
Voted
FCT
2007
Springer
15 years 10 months 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 ...
148
click to vote
ICCS
2007
Springer
15 years 10 months 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...
110
Voted
ISICA
2007
Springer
15 years 10 months 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...
145
Voted
ISSAC
2007
Springer
15 years 10 months 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...
136
click to vote
SARA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. In constraint satisfaction, local search is an incomplete method for finding a solution to a problem. Solving a general constraint satisfaction problem (CSP) is known to...