5138 search results - page 516 / 1028 » Randomized Algorithms for 3-SAT |
170
click to vote
CC
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We present an algorithm for counting the irreducible components of a complex algebraic variety defined by a fixed number of polynomials encoded as straight-line programs ...
193
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
We study the problem of factoring univariate polynomials over finite fields. Under the assumption of the Extended Riemann Hypothesis (ERH), Gao [Gao01] designed a polynomial time ...
176
click to vote
CONNECTION
2006
15 years 7 months ago
2006
By learning a range of possible times over which the effect of an action can take place, a robot can reason more effectively about causal and contingent relationships in the world...
161
click to vote
COR
2007
15 years 7 months ago
2007
The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...
171
click to vote
NPL
2000
15 years 6 months ago
2000
Generative topographic mapping (GTM) is a statistical model to extract a hidden smooth manifold from data, like the self-organizing map (SOM). Although a deterministic search algo...