1379 search results - page 64 / 276 » The Complexity of the Annihilating Polynomial |
139
click to vote
MOBICOM
2006
ACM
15 years 6 months ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
92
Voted
SIGECOM
2005
ACM
15 years 6 months ago
2005
ACM
We study various computational aspects of solving games using dominance and iterated dominance. We first study both strict and weak dominance (not iterated), and show that checki...
105
Voted
IJAC
2007
15 years 15 days ago
2007
The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank...
MOR
2002
15 years 7 days ago
2002
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
124
click to vote
SIAMCOMP
1998
15 years 7 days ago
1998
Polynomial-time safe and unsafe approximations for intractable sets were introduced by Meyer and Paterson [Technical Report TM-126, Laboratory for Computer Science, MIT, Cambridge,...