20 search results - page 4 / 4 » Some Results on Average-Case Hardness Within the Polynomial ... |
SODA
2010
ACM
14 years 2 months ago
2010
ACM
We investigate the preemptive scheduling of periodic tasks with hard deadlines. We show that, even in the uniprocessor case, no polynomial time algorithm can test the feasibility ...
IROS
2007
IEEE
13 years 11 months ago
2007
IEEE
— Motion planning for robotic arms is important for real, physical world applications. The planning for arms with high-degree-of-freedom (DOF) is hard because its search space is...
INFOCOM
2009
IEEE
13 years 12 months ago
2009
IEEE
—We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient...
ISSAC
2007
Springer
13 years 11 months ago
2007
Springer
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
ATAL
2010
Springer
13 years 6 months ago
2010
Springer
Cooperative games provide an appropriate framework for fair and stable resource allocation in multiagent systems. This paper focusses on monotone cooperative games, a class which ...