Sciweavers

7228 search results - page 53 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
CORR
2011
Springer
144views Education» more  CORR 2011»
14 years 1 months ago
Analyzing Walksat on random formulas
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We prove that the Walksat algorithm from [16, 17] finds a satisfying assignment of Φ in pol...
Amin Coja-Oghlan, Alan M. Frieze
ISSAC
2004
Springer
106views Mathematics» more  ISSAC 2004»
15 years 3 months ago
Factoring polynomials via polytopes
We introduce a new approach to multivariate polynomial factorisation which incorporates ideas from polyhedral geometry, and generalises Hensel lifting. Our main contribution is to...
Fatima Abu Salem, Shuhong Gao, Alan G. B. Lauder
GECCO
2007
Springer
193views Optimization» more  GECCO 2007»
15 years 3 months ago
Approximating covering problems by randomized search heuristics using multi-objective models
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann,...
APJOR
2010
118views more  APJOR 2010»
14 years 8 months ago
Alternative Randomization for Valuing American Options
This paper provides a fast and accurate randomization algorithm for valuing American puts and calls on dividend-paying stocks and their early exercise boundaries. The primal focus...
Toshikazu Kimura
ICC
2007
IEEE
101views Communications» more  ICC 2007»
15 years 4 months ago
On the Limitations of Random Sensor Placement for Distributed Signal Detection
— We consider the design of a sensor network for detecting an emitter who if present is known to be located in an interval but whose exact position is unknown. We seek to minimiz...
Zhenyu Tu, Rick S. Blum