4860 search results - page 267 / 972 » SNPs Problems, Complexity, and Algorithms |
124
Voted
TSP
2010
14 years 7 months ago
2010
Abstract--Multichannel fast QR decomposition RLS (MCFQRD-RLS) algorithms are well known for their good numerical properties and low computational complexity. The main limitation is...
113
Voted
KSEM
2009
Springer
15 years 7 months ago
2009
Springer
Measuring the inconsistency degree of an inconsistent knowledge base is an important problem as it provides context information for facilitating inconsistency handling. Many method...
168
Voted
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
Bayesian Networks are today used in various fields and domains due to their inherent ability to deal with uncertainty. Learning Bayesian Networks, however is an NP-Hard task [7]....
101
Voted
EUROPAR
2003
Springer
15 years 5 months ago
2003
Springer
An implementation of a parallel ScaLAPACK-style solver for the general Sylvester equation, op(A)X −Xop(B) = C, where op(A) denotes A or its transpose AT , is presented. The paral...
92
Voted
INFOCOM
1997
IEEE
15 years 4 months ago
1997
IEEE
In this paper, we study the NP-hard delay-constrained least-cost path problem. A solution to this problem is needed to provide real-time communication service to connection-orient...