1383 search results - page 57 / 277 » On the Complexity of the Interlace Polynomial |
163
click to vote
SODA
2010
ACM
16 years 3 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 ...
144
click to vote
GLOBECOM
2008
IEEE
16 years 19 days ago
2008
IEEE
— In this paper we study the complexity of spectrum assignment problems in cognitive radio networks (CRNs) in the presence of several constraints. Although optimal spectrum assig...
174
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
244
click to vote
ISSAC
1997
Springer
15 years 10 months ago
1997
Springer
Gaussian elimination is the basis for classical algorithms for computing canonical forms of integer matrices. Experimental results have shown that integer Gaussian elimination may...
154
click to vote
AIPS
2008
15 years 8 months ago
2008
We present a faster method of solving optimal planning problems and show that our solution performs up to an order of magnitude faster than Satplan on a variety of problems from t...