536 search results - page 61 / 108 » Some Lower Bounds for the Complexity of Continuation Methods |
118
click to vote
AIEDAM
2008
15 years 2 months ago
2008
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
133
click to vote
WSC
2007
15 years 4 months ago
2007
Simulation optimization (SO) is the process of finding the optimum design of a system whose performance measure(s) are estimated via simulation. We propose some ideas to improve o...
115
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
Let f be a univariate polynomial with real coefficients, f ∈ R[X]. Subdivision algorithms based on algebraic techniques (e.g., Sturm or Descartes methods) are widely used for is...
139
click to vote
INFOCOM
2012
IEEE
13 years 4 months ago
2012
IEEE
—Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They implement fast set representations to support membership queries with limited error, and supp...
118
click to vote
ECAI
2000
Springer
15 years 6 months ago
2000
Springer
In this paper, an editing algorithm based on the projection of the examples in each dimension is presented. The algorithm, that we have called EOP (Editing by Ordered Projection) h...