2446 search results - page 14 / 490 » Choiceless Polynomial Time |
GECCO
2009
Springer
16 years 13 days ago
2009
Springer
122
click to vote
DATE
2008
IEEE
16 years 10 days 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...
155
click to vote
FOCS
2008
IEEE
16 years 10 days 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 ...
155
click to vote
ICC
2008
IEEE
16 years 9 days 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...