2446 search results - page 14 / 490 » Choiceless Polynomial Time |
75
Voted
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
94
Voted
DATE
2008
IEEE
15 years 10 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...
128
Voted
FOCS
2008
IEEE
15 years 10 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 ...
126
Voted
ICC
2008
IEEE
15 years 10 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...
97
Voted
IJCNN
2008
IEEE
15 years 10 months ago
2008
IEEE