Sciweavers

684 search results - page 85 / 137
» A multi-parametric programming approach for constrained dyna...
Sort
View
CP
2005
Springer
14 years 2 months ago
Probabilistic Arc Consistency
The two most popular backtrack algorithms for solving Constraint Satisfaction Problems (CSPs) are Forward Checking (FC) and Maintaining Arc Consistency (MAC). MAC maintains full ar...
Deepak Mehta, Marc R. C. van Dongen
ICC
2007
IEEE
14 years 3 months ago
Performance Study of Bandwidth Allocation Techniques for QoS-Constrained Satellite Networks
—The paper analyzes the performance of the bandwidth allocation process over satellite communication systems in presence of specific Quality of Service (QoS) requirements. The re...
Igor Bisio, Mario Marchese
PPOPP
2010
ACM
14 years 6 months ago
Scalable communication protocols for dynamic sparse data exchange
Many large-scale parallel programs follow a bulk synchronous parallel (BSP) structure with distinct computation and communication phases. Although the communication phase in such ...
Torsten Hoefler, Christian Siebert, Andrew Lumsdai...
GCB
2004
Springer
223views Biometrics» more  GCB 2004»
14 years 21 days ago
PoSSuMsearch: Fast and Sensitive Matching of Position Specific Scoring Matrices using Enhanced Suffix Arrays
: In biological sequence analysis, position specific scoring matrices (PSSMs) are widely used to represent sequence motifs. In this paper, we present a new nonheuristic algorithm, ...
Michael Beckstette, Dirk Strothmann, Robert Homann...
BMCBI
2006
129views more  BMCBI 2006»
13 years 9 months ago
Fast index based algorithms and software for matching position specific scoring matrices
Background: In biological sequence analysis, position specific scoring matrices (PSSMs) are widely used to represent sequence motifs in nucleotide as well as amino acid sequences....
Michael Beckstette, Robert Homann, Robert Giegeric...