7129 search results - page 683 / 1426 » Approximation Algorithms for Treewidth |
199
click to vote
GECCO
2008
Springer
15 years 8 months ago
2008
Springer
This paper presents a theoretical definition for designing EDAs called Elitist Convergent Estimation of Distribution Algorithm (ECEDA), and a practical implementation: the Boltzm...
171
Voted
AMC
2008
15 years 7 months ago
2008
This paper discusses the infinite horizon stochastic Nash games with state-dependent noise. After establishing the asymptotic structure along with the positive semidefiniteness for...
213
click to vote
AAECC
2006
Springer
15 years 7 months ago
2006
Springer
So-called nonadjacent representations are commonly used in elliptic curve cryptography to facilitate computing a scalar multiple of a point on an elliptic curve. A nonadjacent rep...
259
Voted
IPL
2006
15 years 7 months ago
2006
We study an NP-hard (and MaxSNP-hard) problem in trees--Multicommodity Demand Flow--dealing with demand flows between pairs of nodes and trying to maximize the value of the routed...
176
click to vote
SIAMSC
2008
15 years 7 months ago
2008
To approximate convolutions which occur in evolution equations with memory terms, a variable-stepsize algorithm is presented for which advancing N steps requires only O(N log N) op...