Sciweavers

1578 search results - page 68 / 316
» Algorithmic randomness of continuous functions
Sort
View
ISSAC
2004
Springer
91views Mathematics» more  ISSAC 2004»
15 years 3 months ago
A poly-algorithmic approach to simplifying elementary functions
Simplification has been long recognised to be a fundamental problem within computer algebra[17]. However, even for the class of elementary functions, it has not been resolved in ...
James C. Beaumont, Russell J. Bradford, James H. D...
COR
2008
107views more  COR 2008»
14 years 9 months ago
Evolutionary functional testing
Evolutionary Testing is a promising approach for automating the testing of software-based systems. A number of papers have been published in the last years which have successfully...
Oliver Bühler, Joachim Wegener
VTC
2010
IEEE
177views Communications» more  VTC 2010»
14 years 8 months ago
Randomized Robot-Assisted Relocation of Sensors for Coverage Repair in Wireless Sensor Networks
—In wireless sensor networks (WSN), stochastic node dropping and unpredictable node failure greatly impair coverage, creating sensing holes, while locally redundant sensors exist...
Greg Fletcher, Xu Li, Amiya Nayak, Ivan Stojmenovi...
CP
2001
Springer
15 years 2 months ago
Random 3-SAT and BDDs: The Plot Thickens Further
Abstract. This paper contains an experimental study of the impact of the construction strategy of reduced, ordered binary decision diagrams (ROBDDs) on the average-case computation...
Alfonso San Miguel Aguirre, Moshe Y. Vardi
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
15 years 10 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang