2899 search results - page 39 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
105
click to vote
CORR
2011
Springer
14 years 8 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...
102
click to vote
INFOCOM
2007
IEEE
15 years 7 months ago
2007
IEEE
— We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...
103
click to vote
ERSHOV
2003
Springer
15 years 6 months ago
2003
Springer
We present several new algorithms as well as new lower and upper bounds for optimizing functions underlying infinite games pertinent to computer-aided verification.
188
click to vote
ICAART
2010
INSTICC
15 years 10 months ago
2010
INSTICC
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
104
click to vote
ANTS
1994
Springer
15 years 5 months ago
1994
Springer
We study the complexity of expressing the greatest common divisor of n positive numbers as a linear combination of the numbers. We prove the NP-completeness of finding an optimal s...