2766 search results - page 339 / 554 » Algorithms for trigonometric polynomials |
138
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
Competent Genetic Algorithms can efficiently address problems in which the linkage between variables is limited to a small order k. Problems with higher order dependencies can onl...
125
click to vote
ANTS
2004
Springer
15 years 10 months ago
2004
Springer
We present a technique to recover f ∈ Q(ζp) where ζp is a primitive pth root of unity for a prime p, given its norm g = f ∗ ¯f in the totally real field Q(ζp + ζ−1 p )....
125
click to vote
COMPGEOM
2010
ACM
15 years 9 months ago
2010
ACM
Sampling conditions for recovering the homology of a set using topological persistence are much weaker than sampling conditions required by any known algorithm for producing a top...
166
click to vote
ISAAC
2001
Springer
15 years 9 months ago
2001
Springer
In current networks, packet losses can occur if routers do not provide sufficiently large buffers. This paper studies how many buffers should be provided in a router to eliminat...
134
click to vote
ATAL
2006
Springer
15 years 8 months ago
2006
Springer
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...