Sciweavers

4860 search results - page 161 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
AISC
2006
Springer
14 years 2 months ago
An Algorithm for Computing the Complete Root Classification of a Parametric Polynomial
Abstract. The Complete Root Classification for a univariate polynomial with symbolic coefficients is the collection of all the possible cases of its root classification, together w...
Songxin Liang, David J. Jeffrey
IPL
2006
79views more  IPL 2006»
13 years 10 months ago
Bandwidth allocation algorithms for weighted maximum rate constrained link sharing policy
This paper addresses the problem of bandwidth allocation under the weighted maximum rate constrained link sharing policy and proves a key theory in the condition of allocation ter...
Jeng Farn Lee, Meng Chang Chen, Ming-Tat Ko, Wanji...
ISAAC
2007
Springer
146views Algorithms» more  ISAAC 2007»
14 years 4 months ago
Bounded Tree-Width and CSP-Related Problems
We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of relational structures C, let LHOM(C, _) be the problem of d...
Tommy Färnqvist, Peter Jonsson
ICPPW
2009
IEEE
13 years 8 months ago
Global Multiprocessor Real-Time Scheduling as a Constraint Satisfaction Problem
In this paper we address the problem of global real-time periodic scheduling on heterogeneous multiprocessor platforms. We give a solution based on a constraint satisfaction proble...
Liliana Cucu-Grosjean, Olivier Buffet
FOCS
2007
IEEE
14 years 4 months ago
Quantum Algorithms for Hidden Nonlinear Structures
Attempts to find new quantum algorithms that outperform classical computation have focused primarily on the nonabelian hidden subgroup problem, which generalizes the central prob...
Andrew M. Childs, Leonard J. Schulman, Umesh V. Va...