2446 search results - page 14 / 490 » Choiceless Polynomial Time |
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
DATE
2008
IEEE
14 years 1 months ago
2008
IEEE
This paper presents two fully polynomial-time sufficient feasibility tests for EDF when considering periodic tasks with arbitrary deadlines and preemptive scheduling on uniproces...
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
We give a randomized O(n polylog n)-time approximation scheme for the Steiner forest problem in the Euclidean plane. For every fixed ǫ > 0 and given n terminals in the plane ...
ICC
2008
IEEE
14 years 1 months ago
2008
IEEE
— Scheduling in an ad hoc wireless network suffers from the non-convexity of the cost function, caused by the interference between communication links. In previous optimization t...
IJCNN
2008
IEEE
14 years 1 months ago
2008
IEEE