2766 search results - page 145 / 554 » Algorithms for trigonometric polynomials |
141
click to vote
ISLPED
2007
ACM
15 years 5 months ago
2007
ACM
We address power minimization of earliest deadline first and ratemonotonic schedules by voltage and frequency scaling. We prove that the problems are NP-hard, and present (1+ ) f...
134
click to vote
COMGEO
2007
ACM
15 years 4 months ago
2007
ACM
In this paper we present a package for implementing exact kinetic data structures built on objects which move along polynomial trajectories. We discuss how the package design was ...
142
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
The interplay between the mutation operator and the selection mechanism plays a fundamental role in the behaviour of evolutionary algorithms (EAs). However, this interplay is stil...
119
click to vote
STOC
2002
ACM
16 years 4 months ago
2002
ACM
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...
124
click to vote
SWAT
2004
Springer
15 years 9 months ago
2004
Springer
The first polynomial time algorithm (O(n4 )) for modular decomposition appeared in 1972 [8] and since then there have been incremental improvements, eventually resulting in linear...